Dissertations / Theses on the topic 'Open problems solving'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 34 dissertations / theses for your research on the topic 'Open problems solving.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Sverin, Tomas. "Open-ended problems in physics : Upper secondary technical program students’ ways of approaching outdoor physics problems." Thesis, Umeå universitet, Institutionen för naturvetenskapernas och matematikens didaktik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-52486.
Full textRandles, Christopher Andrew. "Approaches used by science disciplines when solving open-ended problems and their links to cognitive factors." Thesis, University of Hull, 2015. http://hydra.hull.ac.uk/resources/hull:14010.
Full textGreefrath, Gilbert. "Modelling tasks for learning, teaching, testing and researching." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-79945.
Full textHan, Fang M. Eng Massachusetts Institute of Technology. "Modeling problem solving in Massive Open Online Courses." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/91817.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (page 101).
.Massive Open Online Courses (MOOC) have presented a completely new style of learning and teaching that also brings us a massive amount of student behavioral data. Some of this data is exclusive to the MOOC environment. It opens up many possibilities for educators to study a question they have always wanted to answer: how do students solve problems? In this thesis, we present and address some of the numerous challenges one encounters during the process of mining MOOC data to answer this seemingly simple question. We describe in detail, using the data from MITx's 6.002x Spring 2012 course offering, a large scale, mixed automated and manual process that starts with the re-organization of MOOCdb source data into relevant and retrieval-efficient abstractions we call student resource trajectories and answer type transition matrices. This step must be interleaved with meticulous and painstaking automatic and manual curation of the data to remove errors and irrelevancies while aggregating redundancies, reducing noise and assuring meaningful, trustworthy variables. Regardless, only an estimation of student resource usage behavior during problem solving is available. With all student trajectories for every problem of 6.002X extracted, we demonstrate some analyses of student behaviors for the whole student population. These offer some insight into a problem's level of difficulty and student behavior around a problem type, such as homework. Next, in order to study how students reached the correct solution to a problem, we categorize problem answers and consider how student move from one incorrect answer to their next attempt. This requires extensive filtering out of irrelevancies and rankings. Detailed knowledge of resources, as would be expected of an instructor, appears to be crucial to understanding the implications of the statistics we derive on frequency of resource usage in general and per attempt. We identify solution equivalence and interpretation also as significant hurdles in obtaining insights. Finally, we try to describe students' problem solving process in terms of resource use patterns by using hidden Markov modeling with original variable definitions and 3 different variable relationships (graphical structures). We evaluate how well these models actually describe the student trajectories and try to use them to predict upcoming student submission events on 24 different selected homework problems. The model with the most complex variable relationships proves to be most accurate.
by Fang Han.
M. Eng.
Hinrichs, Thomas Ryland. "Problem solving in open worlds: a case study in design." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/8182.
Full textDuroux, Hélène. "Enseignement des problèmes ouverts en mathématiques et sentiment d’efficacité des enseignants au cycle 2." Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0220.
Full textBased on the difficulties experienced by French pupils in mathematics in national (CEDRE, CP-CE1 national assessments) and international (TIMSS, PISA) surveys, this study proposes a reflection on the teaching of open problems in primary school and on teachers' self-efficacy (noted SEP).There are three objectives. The first is to take stock of how open problems are taught in primary school. The second is to identify and understand the nature of the difficulties encountered by teachers, from the preparation to the implementation of open problems in the classroom. The final objective is to examine the relationship between teachers' self-efficacy and their declared open problems solving practices.To address our research hypotheses, we used a questionnaire (N=280) to measure teachers' self-efficacy in teaching mathematics (SEPEm) and in teaching open problems (SEPEpo), and to report on their declared practices in open problems. We also relied on filmed observation, over the course of a school year, of the actual practices of 6 teachers, representing 17 sequences, or 43 sessions observed in total. Each sequence was followed by self-confrontation interviews.Analysis of the data collected revealed wide disparities in open problems practices (e.g. frequency of open problems sessions, choice of integrating this teaching into the mathematics curriculum, objectives pursued, presence and content of the institutionalisation phase). It also highlights certain invariants in the practice of open problems (e.g. not building a progression in open problems, starting the session with a reading and explanation of the statements, proposing a collective correction, keeping the problem statements, the correct solutions and one or more representations enabling the problems to be solved at the end of the session, or not proposing an assessment) and in the difficulties encountered. In addition, links were found between certain aspects of teaching practices in open problems and teachers’ self-efficacy in this area
Abdi, Yusuf. "Analysis of teachers' discourse moves in open-ended problem solving environment." Saarbrücken VDM Verlag Dr. Müller, 2007. http://d-nb.info/988493004/04.
Full textBahar, Abdulkadir. "The Influence of Cognitive Abilities on Mathematical Problem Solving Performance." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/293594.
Full textSianez, David M. "An Analysis of Successful and Unsuccessful Example Solutions to Enhance Open-Ended Technological Problem-Solving Efficiency Among Middle School Students." Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/27792.
Full textPh. D.
Evans, Marise Meredith Tillman Thomas S. "Maximizing collaborative problem solving within higher education design studios with a minimal open floor plan." Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Industrial_Design/Thesis/Evans_Marise_58.pdf.
Full textEriksson, Magnus. "How to manage crowdsourcing : What companies should think about when implementing the strategy." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-9786.
Full textStewart, Nancy L. "Preparing Young Children to Respond to Art in the Museum." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/3098.
Full textFranke, Nikolaus, Marion K. Poetz, and Martin Schreier. "Integrating Problem Solvers from Analogous Markets in New Product Ideation." INFORMS, 2014. http://dx.doi.org/10.1287/mnsc.2013.1805.
Full textPoliquit, Elmer S. "A method for solving the minimization of the maximum number of open stacks problem within a cutting process." View electronic thesis, 2008. http://dl.uncw.edu/etd/2008-1/r1/poliquite/elmerpoliquit.pdf.
Full textSagaskie, Erin Elizabeth. "The Effect of Instruction in Alternative Solutions on American Ninth-Grade Algebra I Students' Problem Solving Performance." OpenSIUC, 2014. https://opensiuc.lib.siu.edu/dissertations/969.
Full textGómez, Martínez Mario. "Open, Reusable and Configurable Multi Agent Systems: A Knowledge Modelling Approach." Doctoral thesis, Universitat Autònoma de Barcelona, 2004. http://hdl.handle.net/10803/3049.
Full textEsta tesis pretende avanzar hacia la consecución de Sistemas Multiagente abiertos. Nuestros esfuerzos se han centrado en desarrollar un marco de trabajo para Sistemas Multiagente que permita maximizar la reutilización de agentes en diferentes dominios, y soporte la formación de equipos bajo demanda, satisfaciendo los requerimientos de cada problema particular.
Por un lado, este trabajo investiga el uso de Métodos de Solución de Problemas para describir las capacidades de los agentes con el objetivo de mejorar su reutilización. Hemos tenido que adaptar el modelo para trabajar con aspectos específicos de los agentes, como el lenguaje de comunicación y los protocolos de interacción.
Por otro lado, esta tesis propone un nuevo modelo para el Proceso de Solución de Problemas Cooperativo, el cual introduce una fase de configuración previa a la formación de un equipo. El proceso de configuración se encarga de obtener un diseño de equipo, expresado en términos de las tareas a resolver, las capacidades a utilizar, y el conocimiento del dominio disponible.
El marco de trabajo desarrollado ha sido puesto a prueba mediante la implementación de una infraestructura para agentes. Esta infraestructura proporciona un nivel de mediación social para los proveedores y clientes del sistema de resolución de problemas, sin imponer una arquitectura particular para los agentes participantes, ni un modelo mental o lógico para explicar la cooperación.
Las contribuciones de este trabajo adoptan la forma de un marco de trabajo multi-capa, desde los conceptos más abstractos a los más concretos, para terminar con la implementación de una aplicación particular basada en agentes de información cooperativos.
Although Multi Agent Systems are supposed to be open systems, most of the initial research has focused on closed systems, which are designed by one developer team for one homogeneous environment, and one single domain.
This thesis aims to advance some steps towards the realization of the open Multi Agent Systems vision. Our work has been materialized into a framework for developing Multi Agent Systems that maximize the reuse of agent capabilities across multiple application domains, and support the automatic, on-demand configuration of agent teams according to stated problem requirements.
On the one hand, this work explores the feasibility of the Problem Solving Methods approach to describe agent capabilities in a way that maximizes their reuse. However, since Problem Solving Methods are not designed for agents, we have had to adapt them to deal with agent specific concepts concerning the agent communication languages and interaction protocols.
One the other hand, this thesis proposes a new model of the Cooperative Problem Solving process that introduces a Knowledge Configuration stage previous to the Team Formation stage. The Knowledge Configuration process performs a bottom-up design of a team in term of the tasks to be solved, the capabilities required, and the domain knowledge available.
The statements made herein are endorsed by the implementation of an agent infrastructure that has been tested in practice. This infrastructure has been developed according to the electronic institutions formalism to specifying open agent societies. This infrastructure provides a social mediation layer for both requesters and providers of capabilities, without imposing neither an agent architecture, nor an attitudinal theory of cooperation.
The contributions of our work are presented as a multilayered framework, going from the more abstract aspects, to the more concrete, implementation dependent aspects, concluding with the implementation of the agent infrastructure and a particular application example for cooperative information agents.
Mahlobo, Radley Kebarapetse. "A model for an open-ended task-based approach in grade 11 mathematics classes / Radley Kebarapetse Mahlobo." Thesis, North-West University, 2009. http://hdl.handle.net/10394/5080.
Full textThesis (Ph.D. (Education))--North-West University, Potchefstroom Campus, 2010.
Mahlobo, Radley Kebarapetse. "OPEN-ENDED APPROACH TO TEACHING AND LEARNING OF HIGH SCHOOL MATHEMATICS." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80592.
Full textMahlobo, Radley Kebarapetse. "OPEN-ENDED APPROACH TO TEACHING AND LEARNING OF HIGHSCHOOL MATHEMATICS." Proceedings of the tenth International Conference Models in Developing Mathematics Education. - Dresden : Hochschule für Technik und Wirtschaft, 2009. - S. 386 - 389, 2012. https://slub.qucosa.de/id/qucosa%3A1780.
Full textDaniels, Mats. "Developing and Assessing Professional Competencies: a Pipe Dream? : Experiences from an Open-Ended Group Project Learning Environment." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-145983.
Full textFelaktigt tryckt som Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 738
Krein, Jonathan L. "Programming Language Fragmentation and Developer Productivity: An Empirical Study." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/2477.
Full textLuo, Junyan. "The semantic geospatial problem solving environment an enabling technology for geographical problem solving under open, heterogeneous environments /." 2007. http://www.etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-1749/index.html.
Full textSHEN, SHU-AN, and 沈書安. "Solving The Open Vehicle Routing Problem By Ant Colony Optimization." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/ss49q7.
Full text國立高雄第一科技大學
運籌管理系碩士班
105
The purpose of this study is to investigate the Open Vehicle Routing Problem (OVRP), which is different than the conventional vehicle routing problem that the vehicles are not required to return to the depot. The focus of this research is slightly different than the original OVRP in which the vehicles are departing from their home company and end at a collection site. The objectives of this study is to find the best vehicle deployment of each home company and the dispatching plan with least cost. Two cases of this kind of OVRP are defined and studied, case one is that the vehicles end at collection site and case two is that the vehicle has to back to the home company directly from the collection site. In this research, the Aggressive Ant Colony Optimization (AACO) solving procedure which is inspired by Ant Colony System is proposed to solve the OVRP. This solving approach can yield better solution comparing to the traditional search mechanism. All the ants need to compete with one another to win the chance to serve the next customer. The computational results indicate that the proposed heuristic is able to efficiently solve OVRP.
LIN, SHU-YI, and 林書翊. "Solving the Open Vehicle Routing Problem with Stochastic Demand by Ant Colony Optimization." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/y4z34y.
Full text國立高雄科技大學
運籌管理系
107
This study focuses on the Open Vehicle Routing Problem with Stochastic Demand (OVRPSD). OVRP generally occurs when a company hires a fleet or entrusts a distribution business to a third-party logistics providers. The vehicle departs from the station. After the delivery, it ends at a customer point. The customer's demand belongs to the Random Variable, and it is now possible to know the customer's demand. Therefore, it is possible that the vehicle capacity is insufficient during the journey and it is closer to the real life situation. The open vehicle routing problem in two situations is proposed. The first one is the traditional OVRP problem, called Depot to Customer (DtoC). The second type is called Home Company to Collection Site (HtoC), which means that the vehicle starts from the company location and ends at the collection site. For example, the garbage truck starts from the company location and transports the garbage to the incinerator after the last customer point is collected. Therefore, the ant colony optimization is applied to solve this problem. Firstly, the optimal path is finding by minimizing the number of vehicles and then calculating the minimum travel cost. At the same time, all the ants will compete with one another to win the chance to serve the next customer, making the results more competitive. Keywords: open vehicle routing problem, ant colony optimization, stochastic demand
Ahn, Jaesuk. "Attitude-driven decision making for multi-agent team formation in open and dynamic environments." 2009. http://hdl.handle.net/2152/6549.
Full texttext
Wu, Hui-Chin, and 吳惠琴. "Computer-based Assessment of Collaborative Problem Solving Based on Open-ended Items with Multi-agent." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/08243633919687609619.
Full textQafisheh, Mutaz Wajeh Abdlmajid. "Solving the latency problem in real-time GNSS precise point positioning using open source software." Master's thesis, 2020. http://hdl.handle.net/10362/95142.
Full textReal-time Precise Point Positioning (PPP) can provide the Global Navigation Satellites Systems (GNSS) users with the ability to determine their position accurately using only one GNSS receiver. The PPP solution does not rely on a base receiver or local GNSS network. However, for establishing a real-time PPP solution, the GNSS users are required to receive the Real-Time Service (RTS) message over the Network Transported of RTCM via Internet Protocol (NTRIP). The RTS message includes orbital, code biases, and clock corrections. The GNSS users receive those corrections produced by the analysis center with some latency, which degraded the quality of coordinates obtained through PPP. In this research, we investigate the Support Vector Machine (SVR) and RandomForest (RF) as machine learning tools to overcome the latency for clock corrections in the CLK11 and IGS03 products. A BREST International GNSS Services permanent station in France selected as a case study. BNC software implemented in real-time PPP for around three days. Our results showed that the RF method could solve the latency problem for both IGS03 and CLK11. While SVR performed better on the IGS03 than CLK11; thus, it did not solve the latency on CLK11. This research contributes to establishing a simulation of real-time GNSS user who can store and predict clock corrections accordingly to their current observed latency. The self-assessment of the reproducibility level of this study has a rank one out of the range scale from zero to three according to the criteria and classifications are done by (Nüst et al., 2018).
Ye, Wei-Jen, and 葉為任. "A Study on Using Evolutionary Algorithm in Solving the Multi-objective Open Shop Scheduling Problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/21117903977812233838.
Full text東海大學
工業工程與經營資訊學系
95
Along with complex production environment, schedulers often need to consider multiple performance measures for scheduling. It's almost only consider one performance measure for scheduling about open shop scheduling in the literature, previously. It is clearly not well suit in production environment of nowadays. Thereby, we consider two performance measures for scheduling, maximum completion time and total tardiness time. It is well known that most of the open shop scheduling problems are NP-hard. In this paper, we not only use MOGA, NSGA-II and SPEA2, but also design an evolutionary algorithm, called GCEA, to solve multi-objective open shop scheduling problems. In this paper, we generated three size of scheduling problems. For each algorithm and each problem, 30 runs with different random seed have been carried out. We use GCEA, MOGA, NSGA-II and SPEA2 to get Pareto-optimal set(nondominated solutions set), and then comparing these multi-objective evolutionary algorithms performance. Finally, Computational results show that the GCEA algorithm clearly outperforms the other three algorithms.
CHEN, YA-HUI, and 陳雅惠. "Automatic Scoring Processes for the Problem Solving Strategies of Different Denominator Fraction Subtraction Open-ended items." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/19247613392992660707.
Full text亞洲大學
資訊工程學系碩士在職專班
104
Most of the format for computer-based testing in Taiwan is multiple choice. In spite of the advantage of automated grading, the process of solving strategies can not be analyzed. In addition to that, the possibility of guessing among the respondents is likely to happen. On the other hand, the regular test of constructed-response questions will be able to provide the respondents process of solving strategies. Likewise, correcting and grading will be a heavy task for the teachers. In this study, students’multiple-strategies, skills, and the type of error were diagnosed and classified by using the example of different denominator subtraction in math. The automated analysis processes for constructed-response questions could be formed and the cognitive diagnostic analysis was conducted by using DINA and MS-DINA modes. The results of this study show, 1.Two or more than two solving strategies for the same question could be found. The ratio of using mixed fraction is higher than that of using improper fraction. At the same time, the type of error is more diverse and there are lower numbers of occurrences of type of error. 2.In terms of multiple-strategies, skills, and the type of error, the coherence of experts’ grading and automated analysis processes for constructed- response questions can reach the percentage of ninety-five. Therefore, the automated analysis processes for constructed- response questions is effective. 3. Pattern correct classification rate and attribute correct classification rate in mode 2, 3, and 4 are better than those of in mode 1. Pattern correct classification rate and attribute correct classification rate in MS-DINA mode are better than those of in DINA mode. Key word:automated analysis processes, multiple-strategies, cognitive diagnosis models, different denominator fraction subtraction, constructed-response questions
Chen, Yi-Da, and 陳奕達. "Apply Genetic Algorithm for Solving the Multi-Objective Open Shop Scheduling Problem: A Case of Hardware Factory." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/94237642420164829199.
Full text國立勤益技術學院
工業工程與管理系
94
Enterprises progress by competing with each other and the competition includes cost, quality, elasticity, and delivery time. The items mentioned above are close related to schedule. The schedule affects the date of delivery that in turn affects the cost. A good schedule may bring the best achievement and make the effective ways of utilizing the resources. This research takes a hardware company as an example. Its products include door stop, fireproof locks, handle panels etc. There are two main objectives in this research. One is to minimize the tardiness; the other is to minimize makespan. Consider both main goals simultaneously make the solution process more complicated. Thus we proposed a genetic algorithm for solving the problem and hope to reach an approximately optimum schedule. This research uses a hardware factory as an example to verify the effectiveness and the efficiency of the proposed genetic algorithm. As a result it actually can reach a better schedule
Hsiung, Lai Chun, and 賴俊雄. "A Coordinate Representation Particle Swarm Optimization for Solving Open Vehicle Routing Problem with Time Windows and Dedicated Destination." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/85395644949919598951.
Full text東海大學
工業工程與經營資訊學系
103
Nowadays, whether supplier or manufacturer, the logistics and distribution operation is a key of success in the global supply chain. And with the rapid development of electronic commerce recently, how to achieve the on-time delivery is the main target for e-business. Therefore, more and more e-business or enterprises without logistic system are outsourcing logistics that is not core competencies to 3PL. This paper proposes the open vehicle routing problem with time windows (OVRPTW) considering the feature of third party logistics (3PL). In the typical OVRPTW problem, most studies discuss time windows, capacity, routing limitation, and destination of vehicle etc. Most literatures assumed the vehicle wouldn’t back to the depot. However, this paper considers the property of 3PL, which means the destination of vehicle is set to center of 3PL. The characteristic of 3PL compared to literature is very different in this study, and OVRPTW problem is NP-hard so that it is not easy to solve. Hence, this paper addresses an OVRPTW problem considering 3PL and the problem is formulated as a mixed integer linear programming (MILP) model. The objective is to minimize the total travel distance. A coordinate representation particle swarm optimization (CRPSO) algorithm is developed to obtain the best delivery sequencing and the capacity of each vehicle. The computational study shows that the proposed method provides good quality solutions within a reasonable amount of time. Finally, the result compared to PSO also indicates that the CRPSO is competitive.
Lu, Yu-An, and 呂祐安. "Solving Capacitated Open Vehicle Routing Problem by Hybridization of Particle Swarm Optimization Algorithm and Loop 2-OPT Technique." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/t2prs2.
Full text國立屏東科技大學
資訊管理系所
105
The concept of Vehicle Routing Problem (VRP) first appears in military logistics to solve the transmission of information and supplies in battlefield. It had become research interests to the experts and scholars afterwards. The Capacitated Open Vehicle Routing Problem (COVRP) is an extension of VRP; it has provided companies deal with logistics and transportation, reducing the huge cost in vehicles, labor and time during these years. Based on the Particle Swarm Optimization, this thesis adopts the “multi-directional search strategy” to improve search capability of the best solution. In order to sort out a non-crossed path quickly, this thesis proposed “Loop 2-opt” reducing the 2-opt implementation times greatly. The computational results showed that our proposed algorithm can find the 45 solutions of 68 tested instances as the best-known solutions.
Chen, Chen Miao, and 陳貞妙. "One-to-One Computer-based Assessment of Collaborative Problem Solving Based on Open-ended Items for Junior High School." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/36819920530317998944.
Full text(10730865), Scott Tecumseh Thorne. "TEACHER SUPPORTS USING THE FACILITATOR MODEL FOR DUAL CREDIT IN OPEN ENDED DESIGN THINKING COURSEWORK: UNIVERSITY COLLABORATION AND HIGH SCHOOL IMPLEMENTATION." Thesis, 2021.
Find full text