Tesis sobre el tema "Problem Solver"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Problem Solver".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Hoessen, Benoît. "Solving the Boolean satisfiability problem using the parallel paradigm". Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0406/document.
Texto completoThis thesis presents different technique to solve the Boolean satisfiability problem using parallel and distributed architectures. In order to provide a complete explanation, a careful presentation of the CDCL algorithm is made, followed by the state of the art in this domain. Once presented, two propositions are made. The first one is an improvement on a portfolio algorithm, allowing to exchange more data without loosing efficiency. The second is a complete library with its API allowing to easily create distributed SAT solver
Danieli, Adrian B. (Adrian Brian) 1975. "A Tsume-Go life & death problem solver". Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50434.
Texto completoIncludes bibliographical references (p. 61-62).
by Adrian B. Danieli.
S.B.and M.Eng.
Geary, John Michael. "Social work skills : roles of the problem solver /". The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487598303841346.
Texto completoLampl, Damian. "Smart Grid Optimization Using a Capacitated Transshipment Problem Solver". Thesis, North Dakota State University, 2013. https://hdl.handle.net/10365/27120.
Texto completoAhmadi, Ehsan. "SOLVING INCREMENTAL SPECIFICATIONS USING Z3 SMT SOLVER". OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/2036.
Texto completoBain, Stuart y n/a. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Griffith University. School of Information and Communication Technology, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20071126.080227.
Texto completoBain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Faculty of Engineering and Information Technology
Full Text
Li, Changqing. "Wave Diffraction and Refraction Problem and a Block-Wise Band Matrix Solver". W&M ScholarWorks, 1995. https://scholarworks.wm.edu/etd/1539617698.
Texto completoMolari, Luca. "Algoritmi di ottimizzazione per il bus touring problem". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9275/.
Texto completoThi, Thanh Truc Vu. "Testing and optimization of Unicorn Fluid-Structure Interaction solver for simulating an industrial problem". Thesis, KTH, Numerisk analys, NA, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-139104.
Texto completoI industriapplikationer, såsom kraftverk, är frågan om samspelet mellan fluid och struktur alltid närvarande. Närmare bestämt påverkar fluiden kraftverkets struktur genom att applicera en kraft på det och vice versa. Som ett resultat av fluidens kraftpåverkan, kan kraftverkets struktur vibrera eller deformeras. En god förståelse för detta FSI problem kan bidra till att utforma system ifråga om säkerhet, stabilitet och effektivitet. Detta projekt syftar till att optimera och testa Unicorn FSI lösaren från FEniCS projektet. Denna FSI lösare ska därefter användas till att simulera samspelet mellan vätska och struktur i ett experiment, som utförts på Vattenfalls forsknings och utvecklingsavdeling. Målet är att förbättra Unicorn FSI-lösaren för att klara av ett verkligt industriellt problem. Dessutom kan vissa resultaten av simuleringen användas som ett verktyg för att förutsäga beteendet hos ett system under inverkan av en fluid.
Hunt, John. "A task specific integration architecture for multiple problem solver, model-based, diagnostic expert systems". Thesis, Aberystwyth University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308391.
Texto completoPunch, William F. "A diagnosis system using a task integrated problem solver architecture (TIPS), including causal reasoning /". The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487599963589822.
Texto completoSuzuki, Atsushi. "A Parallel Finite Element Solver for Large-Scale 3-D Stokes Problem and its Application to Earth's Mantle Convection Problem". 京都大学 (Kyoto University), 2003. http://hdl.handle.net/2433/148278.
Texto completoHuang, Shuo. "A New Multidomain Approach and Fast Direct Solver for the Boundary Element Method". University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1505125721346283.
Texto completoAda, Ketchie, Nehe Meret y Shapira Hila. "For the Creative Problem-Solver : An Integrated Process of Design Thinking and Strategic Sustainable Development". Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4208.
Texto completoGenc, Balkan Ziya. "Implementation And Comparison Of Turbulence Models On A Flat Plate Problem Using A Navier-stokes Solver". Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1096668/index.pdf.
Texto completos k-epsilon and Wilcox&rsquo
s k-omega turbulence models. To evaluate the performances of these turbulence models and to compare them with each other, the solver has been tested for a case of subsonic, laminar - transition fixed - turbulent flow over a flat plate. The results are verified by analytical solutions and empirical correlations.
Talal, Khan Muhammad. "Formulation of the power flow problem in human readable form for translation into an efficient solver". Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-201090.
Texto completoElkraftsystem är komplexa system som kräver övervakning och styrningför att fungera pålitlighet och säkert. Energy Management Systems (EMS)/SCADA används förövervakning och styrning av systemet. Eftersom effektflöden utgör basen för analys av elkraftsystemfinns beräkningsverktyg (power ow solvers, PFS) integrerat i EMS/SCADA. I och med attelkraftsystemet utvecklas uppstår nya utmaningar, som kräver nya funktionaliteter och krav påEMS/SCADA. Detta resulterar i krav på även PFS. PFS som anvands i EMS/SCADA idag utveckladespå 1970- och 80-talet. Att underhålla och utveckla dessa för att uppfylla de nya kraven blirallt svårare. Detta examensarbete syftar till att utveckla en PFS som är lättare att underhållaoch som är effektiv och anpassningsbar. För att uppnå detta behövs ett programmeringsspråk somuppfyller prestandan som krävs för PFS, och ödesproblemet behöver formuleras om på en högrenivå. I detta examensarbete har era programmeringsspråk granskats, och samtliga uppfyller vissaav kraven men brister i andra. Därför har ett öppet programmeringsspråk (OPL). Detta beskrivereffektödesproblemet på en högre abstraktionsnivå. OPL har utvarderats genom användning förmodellering av ett litet elkraftsystem, för att lösa effektödesproblemet. Modellen inkluderar ävenlindningskopplare och shuntar, vilket visar att konceptet relativt lätt tillåter utökning med flerapparater i systemet.
Oriani, Mattia. "A mixed hybrid finite volumes solver for robust primal and adjoint CFD". Thesis, Queen Mary, University of London, 2018. http://qmro.qmul.ac.uk/xmlui/handle/123456789/39760.
Texto completoSerédi, Silvester. "Evoluční algoritmy v úloze booleovské splnitelnosti". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236224.
Texto completoImmler, Fabian [Verfasser], Tobias [Akademischer Betreuer] Nipkow, Tobias [Gutachter] Nipkow y Warwick [Gutachter] Tucker. "A Verified ODE Solver and Smale's 14th Problem / Fabian Immler ; Gutachter: Tobias Nipkow, Warwick Tucker ; Betreuer: Tobias Nipkow". München : Universitätsbibliothek der TU München, 2018. http://d-nb.info/1163013404/34.
Texto completoPham, Duc Nghia y n/a. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Griffith University. Institute for Integrated and Intelligent Systems, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070216.143447.
Texto completoPham, Duc Nghia. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Thesis, Griffith University, 2006. http://hdl.handle.net/10072/365503.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Daniel, James Gray. "Technical director as problem solver West Virginia University Division of Theatre and Dance's production of A flea in her ear /". Morgantown, W. Va. : [West Virginia University Libraries], 2007. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5531.
Texto completoTitle from document title page. Document formatted into pages; contains iv, 61 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 23).
Dirks, Denise. "Mediation and a Problem Solving Approach to Junior Primary Mathematics". University of the Western Cape, 1996. http://hdl.handle.net/11394/8379.
Texto completoThis study argues that not all children in the Junior Primary phase benefit from the Problem Centred Approach in mathematics that was adapted by the Research, Unit for Mathematics at the University of Stellenbosch (RUMEUS). \One of the reasons could be that not all pupils can construct their own knowledge and methods. There are the highly capable pupils who cope well with this approach. These pupils are able to solve mathematical problems with little or no teacher interaction. Then there are the average and weaker pupils who cannot solve a mathematical problem on their own. These pupils need strategies and skills to solve problems and they need the teacher to mediate these strategies and skills to them, which will help these pupils to become autonomous problem solvers. ,Working in groups can, to some extent, supplement mediation or teacher interaction. Peer group teaching can be effective, whereby pupils are placed in groups so that the more capable pupils can teach concepts or make concepts clearer to the average or weaker pupils). There is, however, the possibility that when pupils of mixed abilities are placed in groups of four there might be one pupil who might refuse to work with the group. This pupil will work on her own and will not share ideas with the other members of the group. If this happens, mediation is necessary for those pupils who cannot solve a mathematical problem on their own. The purpose of this study is to investigate how exposure to mediation can improve pupils' problem solving abilities. As directions for my research I've chosen the first six criteria of Feuerstein's Mediated Learning Experiences (MLE). The first three parameters: intentionality and reciprocity, mediation of transcendence and mediation of meaning _are conditions for an interaction to qualify as MLE. Mediation of competence and regulation of behaviour are functions of specific experiences that combine with the first three to make an adult-child interaction one of mediated learning. Mediation of sharing behaviour . can be added. Here the child and the mediator are engaged in a shared quest for structural change in the child. In addition to this, the five mechanisms of mediational teaching, i.e. process questioning; challenging or asking reasons; bridging; teaching about rules; and emphasising order, predictability, system, sequence and strategy are also used in the implementation of mediation as described by Haywood. Two methods of investigation were chosen. The pupils' problem solving abilities were studied by means of eight word sums, of which the first four word sums were done in the pre-test and the other four word sums in the post-test. After the pre-test and before the post-test there was a period of mediational teaching for the experimental group. During this period and during the post-test the control group was denied mediation. After this research, mediation was also available for the control group. Two pupils from the experimental group were then chosen for further in-depth, think-aloud, person-to-person interviews. The aim of the interviews was to determine why these pupils could not solve the problem in the pre-test, but could successfully solve the post-test question. The results of the word sums in the pre-test and the post-test were compared. The role of strategies and thinking skills is concentrated on in the results. Mediation was not equally successful in all of the four different types of problem sums. Questions one and five contained two or more numbers and here pupils tended to either plus or minus these numbers. Questions two and six also contained numbers, but this is a problem situated in a real life situation. Questions three and seven contained no numbers and questions four and eight compelled pupils to first work out a plan. Mediation was most successful in problem sums situated in a real life situation, followed by problem sums which compelled pupils to first work out a plan, and then by problem sums where there were no numbers. Mediation was least; successful in problem sums that contained two or more numbers. Analysis of these results shows that with mediation there is an improvement in the pupils' problem solving abilities; Mediation can be viewed as S-H-O-H-R, in which the human mediator (H) is interposed between the stimulus (S) and the organism (0), and between the organism and the response (R). We can argue that the Problem Centred Approach without mediation can produce individuals who are little, if at all, affected by their encounter and interaction with new situations. Due to the lack of support in the Problem Centred Approach to Mathematics, it is the aim of this mini-thesis to propose mediation as an essential component in the Problem Centred Approach to Mathematics in the Junior Primary phase.
Wallace, Ian Patrick. "Improved computational approaches to classical electric energy problems". Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/28922.
Texto completoDing, Jian. "Fast Boundary Element Method Solutions For Three Dimensional Large Scale Problems". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/6830.
Texto completoNguyen, Thi Phong. "Direct and inverse solvers for scattering problems from locally perturbed infinite periodic layers". Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX004/document.
Texto completoWe are interested in this thesis by the analysis of scattering and inverse scattering problems for locally perturbed periodic infinite layers at a fixed frequency. This problem has connexions with non destructive testings of periodic media like photonics structures, optical fibers, gratings, etc. We first analyze the forward scattering problem and establish some conditions under which there exist no guided modes. This type of conditions is important as it shows that measurements can be done on a layer above the structure without loosing substantial informations in the propagative part of the wave. We then propose a numerical method that solves the direct scattering problem based on Floquet-Bloch transform in the periodicity directions of the background media. We discretize the problem uniformly in the Floquet-Bloch variable and use a spectral method in the space variable. The discretization in space exploits a volumetric reformulation of the problem in a cell (Lippmann-Schwinger integral equation) and a periodization of the kernel in the direction orthogonal to the periodicity. The latter allows the use of FFT techniques to speed up Matrix-Vector product in an iterative to solve the linear system. One ends up with a system of coupled integral equations that can be solved using a Jacobi decomposition. The convergence analysis is done for the case with absorption and numerical validating results are conducted in 2D. For the inverse problem we extend the use of three sampling methods to solve the problem of retrieving the defect from the knowledge of mutistatic data associated with incident near field plane waves. We analyze these methods for the semi-discretized problem in the Floquet-Bloch variable. We then propose a new method capable of retrieving directly the defect without knowing either the background material properties nor the defect properties. This so-called differential-imaging functional that we propose is based on the analysis of sampling methods for a single Floquet-Bloch mode and the relation with solutions toso-called interior transmission problems. The theoretical investigations are corroborated with numerical experiments on synthetic data. Our analysis is done first for the scalar wave equation where the contrast is the lower order term of the Helmholtz operator. We then sketch the extension to the cases where the contrast is also present in the main operator. We complement our thesis with two results on the analysis of the scattering problem for periodic materials with negative indices. Weestablish the well posedness of the problem in 2D in the case of a contrast equals -1. We also show the Fredholm properties of the volume potential formulation of the problem using the T-coercivity approach in the case of a contrast different from -1
Miller, Catherine Marie 1959. "Teachers as problem solvers/problem solvers as teachers: Teachers' practice and teaching of mathematical problem solving". Diss., The University of Arizona, 1996. http://hdl.handle.net/10150/282150.
Texto completoUgarte, Crystal. "A numerical investigation of Anderson localization in weakly interacting Bose gases". Thesis, KTH, Numerisk analys, NA, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-269167.
Texto completoSyftet med denna avhandling är att undersöka hur väl Gross-Pitaevskii egenvärdesekvation (GPE) passar som en fysisk modell för bildandet av stationära elektronstater i utspädda Bose-gaser vid extremt låga temperaturer. Fenomenet som skall undersökas heter Anderson lokalisering och uppstår när potentialfältets styrka och störning i systemet är tillräckligt hög. Undersökningen görs i denna avhandling genom att numeriskt lösa GPE samt illustrera olika utfall av Anderson lokaliseringen vid olika numeriska värden. Den första delen av rapporten introducerar det icke-linjära matematiska uttrycket för GPE samt de numeriska metoderna som används för att lösa problemet numerisk: finita elementmetoden (FEM) samt egenvärdesalgoritmen som heter inversiiteration. Finita elementmetoden används för att diskretisera variationsproblemet av GPE och ta fram en enkel algebraisk ekvation. Egenvärdesalgoritmen tillämpas på den algebraiska ekvation för att iterativt beräkna egenfunktionen som motsvarar det minsta egenvärdet. Det minsta egenvärdet av en fullt definierad (linjär) Schrödinger ekvation löses i rapportens andra del. Den linjära ekvationen löses för att ta fram en förenklad numerisk algoritm att utgå ifrån innan den icke-linjära algoritmen tas fram. För att försäkra sig att den linjära algoritmen stämmer bra jämförs det exakta egenvärdet för problemet med ett numeriskt framtaget värde. Undersökningen av den linjära algoritmen visar att vi får en bra uppskattning av egenvärdet - även vid få iterationer. Vidare konstrueras den ickelinjära algoritmen baserat på den linjära. Ekvationen löses och undersökes. Egenfunktionen som motsvarar minsta egenvärdet framtas och beskriver kvantsystemet i lägsta energitillståndet, så kallade grundtillståndet. Undersökningen av GPE visar att de numeriska metoderna kräver många fler iterationer innan en tillräckligt bra uppskattning av egenvärdet fås. Å andra sidan fås markanta Anderson lokaliseringar för ett skalningsområde som beskrivs av styrkan av potentialfältet i relation till dess störning. Slutsatsen är att Gross-Pitaevskii egenvärdesekvation passar bra som en fysisk modell för detta kvantsystem.
Bousmar, Khadija. "Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel". Electronic Thesis or Diss., Université de Lorraine, 2018. http://www.theses.fr/2018LORR0341.
Texto completoIn this thesis, we address a topic in the field of industrial engineering related to solving a fundamental decision problem in the theory of complexity and propositional satisfiability called SAT. The latter is usually presented in a mathematical formalism, allowing the modelling of complex problems, both academic and from real world. These problems are presented in boolean form in order to check their feasibility. They relate to several application areas, such as hardware and software verification, telecommunications, medicine, and planning. The evolution and progress observed in recent years in the field of problem-solving using SAT has made it possible to reinforce the conviction that this field can be even more promising in solving difficult (complex or complex NP) problems and that more attention needs to be dedicated to it. It is with this in mind that we have taken an interest in applying it to purely industrial problems in order to propose contributions in a new field of application. The objective of this thesis is to develop decision-support tools that can be used in the field of industrial risk management. Although the SAT formalism is very powerful, in practice, when the targeted problems are large, the resolution tools prove to be less effective. Therefore, the aim of this research is to develop a rapid hardware architecture (with FPGA-targeted implementation) that allows massive acceleration of resolution due to the high level of parallel processing of the hardware approach. In this thesis, two main aspects are studied and developed to solve a problem of management of industrial production resources. These aspects are, on the one hand, the basic principles of operation and resolution of a generic SAT configurable solver and, on the other hand, methods adapted to the operating principle adopted for the hardware solver. Indeed, although targeting goals comparable to those of the software approach (optimization of the search space path), the material approach requires the development of specific resolution methods. These have been specifically optimised for the target application area of industry. The effectiveness of the material approach developed showed satisfactory results, point of view of the number of variables used and resolution time on the problems tested
Procházka, Lukáš. "Redukce nedeterministických konečných automatů". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-237032.
Texto completoBieszczad, Andrzej Carleton University Dissertation Engineering Systems and Computer. "Neuromorphic distributed general problem solvers". Ottawa, 1996.
Buscar texto completoZhang, Huaibao. "HIGH TEMPERATURE FLOW SOLVER FOR AEROTHERMODYNAMICS PROBLEMS". UKnowledge, 2015. https://uknowledge.uky.edu/me_etds/64.
Texto completoPrice, Christopher John. "Model reuse in diverse problem solvers". Thesis, Aberystwyth University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241799.
Texto completoAraujo, Luiz Jonatã Pires de. "A hybrid methodology to solve the container loading problem with weight distribution and cutting problems". Universidade de Fortaleza, 2011. http://dspace.unifor.br/handle/tede/88221.
Texto completoTransport of goods has represented an important role in economic development throughout the history and ship containerization brought great advantages. Its invention in mid-1950s brought down the cost of transport and reduced time for loading and unloading cargo. Consequently, it increased efficiency of port working and reduced handling cargo to hours instead of weeks, as before. However, the good use of containerization involves new and specialized logistic process, a number of technologies and automated systems to handle a great number of containers and even greater volume of cargo. To answer these requirements, computation appears as important tool. The described scenary has been treated in academic literature as the Container Loading Problem (CLP), with some variants. It is necessary consider practical requirements, for example the stability of cargo or weight distribution. The last one is of vital importance since the position of the centre of gravity of cargo affects the stability during its transport. When desconsidered, it could result in damage to cargo or vehicle. During our research, we were specially interested in this requirement. But, in order compare the found solutions with other ones, we proposed a methodology to measures the weight distribution. So, to the described problem, specifically the Knapsack Loading Problem (3D-KLP), this work presents a methodology that not only maximizes the packed cargo volume but also optimizes the weight distribution, its great contribution. Mainly if we consider that the cargo to be packed is composed by items with different densities, which turns the problem more difficult. The present methodology is composed by two phases with distinct goals. The first phase is concerned with maximize the weight distribution combining a search algorithm, the backtracking, with heuristics that solve integer linear programming models. The second phase executes a Genetic Algorithm to maximize the weight distribution of previously packed cargo. We also present a justification for why genetic algorithm was used in our methodology. An additional application was made to solve cutting problems. This class of problems occurs in various industrial process, when it is necessary to cut different types of material as glass, wood or parper, with a minimum of waste. We use a well-known benchmark test to compare our results with other approaches. This work also presents a case study of our implementation using some real data in a factory of stoves and refrigerators in Brazil. It shown promising results in reduced time. Keywords: Container Loading Problem, Knapsack Loading Problem, Weight Distribution, Integer Programming, Backtracking, Genetic Algorithms.
O transporte de carga tem representado um papel fundamental no desenvolvimento econômico no decorrer da história e a conteinerização trouxe grandes vantagens. Seu advento reduziu os custos de transporte bem como o tempo de carga. Portanto, aumentou a eficiência do trabalho em portos e reduziu o tempo necessário para operações com carga para horas, ao invés de semanas como anteriormente. Contudo, o bom uso dos contêineres involve novos e especializados processos logísticos, uma grande quantidade de tecnologias além de sistemas automatizados para manipular uma elevada quantidade de contêineres e ainda maior volume de carga. Para atender a estes requisitos, computação aparece como uma importante ferramenta. O cenário descrito tem sido tratado na literatura acadêmica como o Problema de Carregamento de Contêiner (CLP, do inglês Container Loading Problem), com algumas variantes. é também necessário considerar requisitos práticos como, por exemplo, a estabilidade da carga ou distribuição do peso. Este último de vital importância uma vez que o centro de gravidade da carga afeta a estabilidade durante seu transporte. Se descosiderado, pode-se danificar tanto a carga como o veículo. Durante nossa pesquisa, nós estivemos especialmente interessados neste requisito. E a fim de comparar a qualidade dos resultados obtidos, propusemos uma maneira de mensurar a distribuição do peso. Portanto, dado o problema descrito, especificamente o 3D Knapsack Loading Problem, este trabalho apresenta um algoritmo que não apenas maximiza o volume total carregado mas também otimiza a distribuição do peso da carga, sua grande contribuição. Principalmente se considerarmos que a carga é composta de itens com diferentes valores de densidade, o que torna o problema ainda mais difícil. A metodologia consiste em duas fases com objetivos diferentes. A primeira fase ocupa-se em maximizar o volume carregado por combinar um algoritmo de busca, o backtracking, com heurísticas que resolvem modelos de programação linear inteira. A segunda fase executa um algoritmo genético para maximizar a distribuição do peso da carga previamente colocada. Apresentamos também uma justificativa do porque algoritmo genéticos foram usados em nossa metodologia. Uma aplicação adicional foi feita para resolver problemas de corte. Esta classe de problemas ocorre em vários processos industriais, quando é necessário cortar diferentes tipos de materiais, como vidro, madeira ou papel, com um mínimo de desperdício. A fim de comparação, usamos bibliotecas de teste bem conhecidas na literatura e um estudo de caso usando informações reais de uma fábrica de fogões e geladeiras no Brasil. São apresentados resultados promissores alcançados em tempo reduzido. Palavras-chave: Problema de Carregamento de Contêiner, Knapsack Loading Problem, Distribuição do Peso, Programação Linear Inteira, Backtracking, Algoritmos Genéticos.
Dewaal, Nicholas. "The Importance of the Riemann-Hilbert Problem to Solve a Class of Optimal Control Problems". Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1759.pdf.
Texto completoVenkata, Narasimha Koushik Srinath. "Ant Colony Optimization Technique to Solve Min-Max MultiDepot Vehicle Routing Problem". University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1324399082.
Texto completoLu, Zhaosong. "Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7151.
Texto completoBeuchler, Sven. "Fast solvers for degenerated problems". Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200600611.
Texto completoKohengadol, Roni A. "Nonlinear solvers for plasticity problems". Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0408104-111231.
Texto completoMedina, Juan Pablo. "Bitter beers: a spatial orientation problem solved". Revista de Química, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/99714.
Texto completoDetermination of the stereochemistry of organic compounds has been a problem that the scientific community has been giving solution to over the years. Different methods have emerged, such as X-ray Diffraction or different types of Nuclear Magnetic Resonance (NMR). However, it just has been discovered that the method used in the determination of the absolute configuration of the α-acids derived from hops used in the manufacture of bitter beers, was not the appropriate.
Lewis, Ryan. "A Problem Well Defined is Nearly Solved". University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1277124765.
Texto completoShaw-Hones, Gayle E. Haslam Elizabeth L. "Learning to solve problems within a pharmaceutical organization : designing problem and story-based constructivist e-learning environments /". Philadelphia, Pa. : Drexel University, 2008. http://hdl.handle.net/1860/2827.
Texto completoLiestøl, Lars. "Adaption of a two phase solver for axisymmetric problems". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for energi- og prosessteknikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-18792.
Texto completoMcCluskey, T. L. "Experience-driven heuristic acquisition in general problem solvers". Thesis, City University London, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234449.
Texto completoLopez, Lurdes. "HELPING AT-RISK STUDENTS SOLVE MATHEMATICAL WORD PROBLEMS THROUGH THE USE OF DIRECT INSTRUCTION AND PROBLEM SOLVING STRATEGIES". Master's thesis, University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3193.
Texto completoM.Ed.
Other
Graduate Studies;
K-8 Math and Science MEd
Nemani, Ashish Kumar. "Combinational approaches to solve scheduling problems". [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0041090.
Texto completoDrexler, Michael. "Newton's method as a global solver for non-linear problems". Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360197.
Texto completoWhitford, Angela Tracy. "Heuristic approaches to solve the frequency assignment problem". Thesis, Goldsmiths College (University of London), 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321956.
Texto completoVazquez, ortiz Karla Esmeralda. "Advanced methods to solve the maximum parsimony problem". Thesis, Angers, 2016. http://www.theses.fr/2016ANGE0015/document.
Texto completoPhylogenetic reconstruction is considered a central underpinning of diverse fields like ecology, molecular biology and physiology where genealogical relationships of species or gene sequences represented as trees can provide the most meaningful insights into biology. Maximum Parsimony (MP) is an important approach to solve the phylogenetic reconstruction based on an optimality criterion under which the tree that minimizes the total number of genetic transformations is preferred. In this thesis we propose different methods to cope with the combinatorial nature of this NP-complete problem. First we present a competitive Simulated Annealing algorithm which helped us find trees of better parsimony score than the ones that were known for a set of instances. Second, we propose a Path-Relinking technique that appears to be suitable for tree comparison but not for finding trees of better quality. Third, we give a GPU implementation of the objective function of the problem that can reduce the runtime for instances that have an important number of residues per taxon. Finally, we introduce a predictor that is able to estimate the best parsimony score of a huge set of instances with a high accuracy