Gotowe bibliografie tematyczne / Problem Solver

Gotowa bibliografia na temat „Problem Solver”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 19 lutego 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Problem Solver”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Problem Solver"

1

Gogodze, Joseph. "Ranking Methods for Multicriteria Decision-Making: Application to Benchmarking of Solvers and Problems". Scientific Programming 2021 (11.07.2021): 1–14. http://dx.doi.org/10.1155/2021/5513860.

Pełny tekst źródła
Streszczenie:
Evaluating the performance assessments of solvers (e.g., for computation programs), known as the solver benchmarking problem, has become a topic of intense study, and various approaches have been discussed in the literature. Such a variety of approaches exist because a benchmark problem is essentially a multicriteria problem. In particular, the appropriate multicriteria decision-making problem can correspond naturally to each benchmark problem and vice versa. In this study, to solve the solver benchmarking problem, we apply the ranking-theory method recently proposed for solving multicriteria decision-making problems. The benchmarking problem of differential evolution algorithms was considered for a case study to illustrate the ability of the proposed method. This problem was solved using ranking methods from different areas of origin. The comparisons revealed that the proposed method is competitive and can be successfully used to solve benchmarking problems and obtain relevant engineering decisions. This study can help practitioners and researchers use multicriteria decision-making approaches for benchmarking problems in different areas, particularly software benchmarking.
Style APA, Harvard, Vancouver, ISO itp.
2

Joseph, Ron. "Painting problem solver". Metal Finishing 106, nr 9 (wrzesień 2008): 56–57. http://dx.doi.org/10.1016/s0026-0576(08)80289-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 1 (styczeń 2009): 47. http://dx.doi.org/10.1016/s0026-0576(09)80010-x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 3 (marzec 2009): 44–45. http://dx.doi.org/10.1016/s0026-0576(09)80051-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 4 (styczeń 2009): 62. http://dx.doi.org/10.1016/s0026-0576(09)80078-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 7-8 (lipiec 2009): 47. http://dx.doi.org/10.1016/s0026-0576(09)80206-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 9 (wrzesień 2009): 51–52. http://dx.doi.org/10.1016/s0026-0576(09)80234-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 10 (październik 2009): 45. http://dx.doi.org/10.1016/s0026-0576(09)80256-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 6 (czerwiec 2009): 60–62. http://dx.doi.org/10.1016/s0026-0576(09)80298-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Joseph, Ron. "Painting problem solver". Metal Finishing 107, nr 11 (listopad 2009): 34. http://dx.doi.org/10.1016/s0026-0576(09)80375-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Problem Solver"

1

Hoessen, Benoît. "Solving the Boolean satisfiability problem using the parallel paradigm". Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0406/document.

Pełny tekst źródła
Streszczenie:
Cette thèse présente différentes techniques permettant de résoudre le problème de satisfaction de formule booléenes utilisant le parallélisme et du calcul distribué. Dans le but de fournir une explication la plus complète possible, une présentation détaillée de l'algorithme CDCL est effectuée, suivi d'un état de l'art. De ce point de départ, deux pistes sont explorées. La première est une amélioration d'un algorithme de type portfolio, permettant d'échanger plus d'informations sans perte d'efficacité. La seconde est une bibliothèque de fonctions avec son interface de programmation permettant de créer facilement des solveurs SAT distribués
This 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
Style APA, Harvard, Vancouver, ISO itp.
2

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.

Pełny tekst źródła
Streszczenie:
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 61-62).
by Adrian B. Danieli.
S.B.and M.Eng.
Style APA, Harvard, Vancouver, ISO itp.
3

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lampl, Damian. "Smart Grid Optimization Using a Capacitated Transshipment Problem Solver". Thesis, North Dakota State University, 2013. https://hdl.handle.net/10365/27120.

Pełny tekst źródła
Streszczenie:
A network flow model known as the capacitated transshipment problem, or CTP, can represent key aspects of a smart grid test network with the goal of finding minimum cost electric power flows using multiple different cost performance metrics. A custom CTP Solver was developed and implemented as an ASP.NET web application in an effort to study these various minimum cost smart grid problems and provide their optimal solutions. The CTP Solver modifies traditional linear programming concepts by introducing object oriented software development practices, as well as an insightful innovation for handling bidirectional arcs, which effectively halves the required disk and memory allocation of fully bidirectional networks. As an initial step toward smart grid optimization problem solutions, the CTP Solver provides a glimpse of how self-healing and possibly other key components of smart grid architecture might be handled in the future.
Style APA, Harvard, Vancouver, ISO itp.
5

Ahmadi, Ehsan. "SOLVING INCREMENTAL SPECIFICATIONS USING Z3 SMT SOLVER". OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/2036.

Pełny tekst źródła
Streszczenie:
Many problems in nature can be represented as some kind of a satisfiability problem. Several SAT solvers and SMT solvers have been developed in the last decade with the goal of checking the satisfiability of different SAT problems. An all-solution satisfiability modulo theories on top of the Z3 SMT solver is presented that uses the clause blocking algorithm to find all the solution sets of a SAT problem. Then, an incremental All-SMT solver has been presented based on the all-SMT solver which is able to find the satisfiable answers of an incremental SMT problem based on the solution set of the original problem.
Style APA, Harvard, Vancouver, ISO itp.
6

Bain, Stuart, i 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.

Pełny tekst źródła
Streszczenie:
The notion that a universally effective problem solver may still exist, and is simply waiting to be found, is slowly being abandoned in the light of a growing body of work reporting on the narrow applicability of individual heuristics. As the formalism of the constraint satisfaction problem remains a popular choice for the representation of problems to be solved algorithmically, there exists an ongoing need for new algorithms to effciently handle the disparate range of problems that have been posed in this representation. Given the costs associated with manually applying human algorithm development and problem solving expertise, methods that can automatically adapt to the particular features of a specific class of problem have begun to attract more attention. Whilst a number of authors have developed adaptive systems, the field, and particularly with respect to their application to constraint satisfaction problems, has seen only limited discussion as to what features are desirable for an adaptive constraint system. This may well have been a limiting factor with previous implementations, which have exhibited only subsets of the five features identified in this work as important to the utility of an adaptive constraint satisfaction system. Whether an adaptive system exhibits these features depends on both the chosen represen-tation and the method of adaptation. In this thesis, a three-part representation for constraint algorithms is introduced, which defines an algorithm in terms of contention, preference and selection functions. An adaptive system based on genetic programming is presented that adapts constraint algorithms described using the mentioned three-part representation. This is believed to be the first use of standard genetic programming for learning constraint algo-rithms. Finally, to further demonstrate the efficacy of this adaptive system, its performance in learning specialised algorithms for hard, real-world problem instances is thoroughly evaluated. These instances include random as well as structured instances from known-hard benchmark distributions, industrial problems (specifically, SAT-translated planning and cryptographic problems) as well as over-constrained problem instances. The outcome of this evaluation is a set of new algorithms - valuable in their own right - specifically tailored to these problem classes. Partial results of this work have appeared in the following publications: [1] Stuart Bain, John Thornton, and Abdul Sattar (2004) Evolving algorithms for constraint satisfaction. In Proc. of the 2004 Congress on Evolutionary Computation, pages 265-272. [2] Stuart Bain, John Thornton, and Abdul Sattar (2004) Methods of automatic algorithm generation. In Proc. of the 9th Pacific Rim Conference on AI, pages 144-153. [3] Stuart Bain, John Thornton, and Abdul Sattar. (2005) A comparison of evolutionary methods for the discovery of local search heuristics. In Australian Conference on Artificial Intelligence: AI'05, pages 1068-1074. [4] Stuart Bain, John Thornton, and Abdul Sattar (2005) Evolving variable-ordering heuristics for constrained optimisation. In Principles and Practice of Constraint Programming: CP'05, pages 732-736.
Style APA, Harvard, Vancouver, ISO itp.
7

Bain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.

Pełny tekst źródła
Streszczenie:
The notion that a universally effective problem solver may still exist, and is simply waiting to be found, is slowly being abandoned in the light of a growing body of work reporting on the narrow applicability of individual heuristics. As the formalism of the constraint satisfaction problem remains a popular choice for the representation of problems to be solved algorithmically, there exists an ongoing need for new algorithms to effciently handle the disparate range of problems that have been posed in this representation. Given the costs associated with manually applying human algorithm development and problem solving expertise, methods that can automatically adapt to the particular features of a specific class of problem have begun to attract more attention. Whilst a number of authors have developed adaptive systems, the field, and particularly with respect to their application to constraint satisfaction problems, has seen only limited discussion as to what features are desirable for an adaptive constraint system. This may well have been a limiting factor with previous implementations, which have exhibited only subsets of the five features identified in this work as important to the utility of an adaptive constraint satisfaction system. Whether an adaptive system exhibits these features depends on both the chosen represen-tation and the method of adaptation. In this thesis, a three-part representation for constraint algorithms is introduced, which defines an algorithm in terms of contention, preference and selection functions. An adaptive system based on genetic programming is presented that adapts constraint algorithms described using the mentioned three-part representation. This is believed to be the first use of standard genetic programming for learning constraint algo-rithms. Finally, to further demonstrate the efficacy of this adaptive system, its performance in learning specialised algorithms for hard, real-world problem instances is thoroughly evaluated. These instances include random as well as structured instances from known-hard benchmark distributions, industrial problems (specifically, SAT-translated planning and cryptographic problems) as well as over-constrained problem instances. The outcome of this evaluation is a set of new algorithms - valuable in their own right - specifically tailored to these problem classes. Partial results of this work have appeared in the following publications: [1] Stuart Bain, John Thornton, and Abdul Sattar (2004) Evolving algorithms for constraint satisfaction. In Proc. of the 2004 Congress on Evolutionary Computation, pages 265-272. [2] Stuart Bain, John Thornton, and Abdul Sattar (2004) Methods of automatic algorithm generation. In Proc. of the 9th Pacific Rim Conference on AI, pages 144-153. [3] Stuart Bain, John Thornton, and Abdul Sattar. (2005) A comparison of evolutionary methods for the discovery of local search heuristics. In Australian Conference on Artificial Intelligence: AI'05, pages 1068-1074. [4] Stuart Bain, John Thornton, and Abdul Sattar (2005) Evolving variable-ordering heuristics for constrained optimisation. In Principles and Practice of Constraint Programming: CP'05, pages 732-736.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Faculty of Engineering and Information Technology
Full Text
Style APA, Harvard, Vancouver, ISO itp.
8

Li, Changqing. "Wave Diffraction and Refraction Problem and a Block-Wise Band Matrix Solver". W&M ScholarWorks, 1995. https://scholarworks.wm.edu/etd/1539617698.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Molari, Luca. "Algoritmi di ottimizzazione per il bus touring problem". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9275/.

Pełny tekst źródła
Streszczenie:
Nel campo della Ricerca Operativa e dei problemi di ottimizzazione viene presentato un problema, denominato Bus Touring Problem (BTP), che modella una problematica riguardante il carico e l’instradamento di veicoli nella presenza di di vincoli temporali e topologici sui percorsi. Nel BTP, ci si pone il problema di stabilire una serie di rotte per la visita di punti di interesse dislocati geograficamente da parte di un insieme di comitive turistiche, ciascuna delle quali stabilisce preferenze riguardo le visite. Per gli spostamenti sono disponibili un numero limitato di mezzi di trasporto, in generale eterogenei, e di capacitá limitata. Le visite devono essere effettuate rispettando finestre temporali che indicano i periodi di apertura dei punti di interesse; per questi, inoltre, é specificato un numero massimo di visite ammesse. L’obiettivo é di organizzare il carico dei mezzi di trasporto e le rotte intraprese in modo da massimizzare la soddisfazione complessiva dei gruppi di turisti nel rispetto dei vincoli imposti. Viene presentato un algoritmo euristico basato su Tabu Search appositamente ideato e progettato per la risoluzione del BTP. Vengono presentati gli esperimenti effettuati riguardo la messa appunto dei parametri dell'algoritmo su un insieme di problemi di benchmark. Vengono presentati risultati estesi riguardo le soluzioni dei problemi. Infine, vengono presentate considerazioni ed indicazioni di sviluppo futuro in materia.
Style APA, Harvard, Vancouver, ISO itp.
10

Thi, 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.

Pełny tekst źródła
Streszczenie:
In industry applications, such as power supply plants, the issue of interaction between fluid and structure is always presented. More precisely, the fluid flow affects the structure by applying force(s) on it and vice versa. As a result, the structure can move (vibrate) or deform. A good understanding of this problem can help to design the system in term of safety, stability and efficiency. This project aims to optimize and test the Unicorn FSI solver from the FEniCS project [1] to simulate the interaction of fluid and structure in an experiment, which was carried out at Vattenfall Research and Development. The target is to improve the Unicorn FSI solver to cope with a real industrial problem. Moreover, some results of the simulation can be used as a tool to predict the behavior of a system under the effect of fluid flow
I 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.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Problem Solver"

1

Ward, Rosemary. Garden problem solver. London: Mitchell Beazley, 2012.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Greene, Harry. DIY problem solver. London: Pan Books, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

John, Edwards. Sprint problem solver. Glenview, Ill: Scott, Foresman, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Barden, William T. DOS problem solver. Glenview, Ill: Scott, Foresman, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Garden problem solver. London: Dorling Kindersley, 2001.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Jourdain, Robert. Programmer's problem solver. Wyd. 2. New York: Brady Pub., 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Eichlin, Cathy. Ventura problem solver. Glenview, Ill: Scott, Foresman, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Spanish problem solver. New York: McGraw-Hill, 2012.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Blodgett, Ralph H. WordPerfect problem solver. Glenview, Ill: Scott, Foresman, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

The knitting problem-solver. Pownal, Vt: Storey Communications, 1991.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Problem Solver"

1

Hmer, Ali, i Malek Mouhoub. "Teaching Assignment Problem Solver". W Trends in Applied Intelligent Systems, 298–307. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13025-0_32.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ma, Wei-Chiu, Shenlong Wang, Jiayuan Gu, Sivabalan Manivasagam, Antonio Torralba i Raquel Urtasun. "Deep Feedback Inverse Problem Solver". W Computer Vision – ECCV 2020, 229–46. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58558-7_14.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Nikolić, Gordana, Dario Zorić, Alan Martinović i David Dubrović. "The PAR Logistics Solver Problem". W Computer Communications and Networks, 271–74. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84996-510-1_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Dressler, Oskar, i Adam Farquhar. "Problem Solver Control Over the ATMS". W GWAI-89 13th German Workshop on Artificial Intelligence, 17–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-75100-4_3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Clarke, Sue. "The Illustrator as Visual Problem Solver". W A Companion to Illustration, 199–228. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2019. http://dx.doi.org/10.1002/9781119185574.ch9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Garrette, Bernard, Corey Phelps i Olivier Sibony. "Conclusion: Becoming a Master Problem-Solver". W Cracked it!, 271–74. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89375-4_13.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Minton, Steven. "Overview of the PRODIGY Problem Solver". W The Kluwer International Series in Engineering and Computer Science, 27–50. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-1703-6_3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Basdevant, Jean-Louis, i Jean Dalibard. "The EPR Problem and Bell’s Inequality". W The Quantum Mechanics Solver, 89–99. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-13724-3_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Basdevant, Jean-Louis, i Jean Dalibard. "Exact Results for the Three-Body Problem". W The Quantum Mechanics Solver, 213–21. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-13724-3_21.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Tomlinson, Tom. "Ethics Consultant: Problem Solver or Spiritual Counselor?" W Performance, Talk, Reflection, 43–52. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-017-2556-9_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Problem Solver"

1

Lu, Ying, Jedediyah Williams, Jeff Trinkle i Claude Lacoursière. "A Framework for Problem Standardization and Algorithm Comparison in Multibody System". W ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-35041.

Pełny tekst źródła
Streszczenie:
The underlying dynamic model of multibody systems takes the form of a differential Complementarity Problem (dCP), which is nonsmooth and thus challenging to integrate. The dCP is typically solved by discretizing it in time, thus converting the simulation problem into the problem of solving a sequence of complementarity problems (CPs). Because the CPs are difficult to solve, many modelling options that affect the dCPs and CPs have been tested, and some reformulation and relaxation options affecting the properties of the CPs and solvers have been studied in the hopes to find the “best” simulation method. One challenge within the existing literature is that there is no standard set of benchmark simulations. In this paper, we propose a framework of Benchmark Problems for Multibody Dynamics (BPMD) to support the fair testing of various simulation algorithms. We designed and constructed a BPMD database and collected an initial set of solution algorithms for testing. The data stored for each simulation problem is sufficient to construct the CPs corresponding to several different simulation design decisions. Once the CPs are constructed from the data, there are several solver options including the PATH solver, nonsmooth Newton methods, fixed-point iteration methods for nonlinear problems, and Lemke’s algorithm for linear problems. Additionally, a user-friendly interface is provided to add customized models and solvers. As an example benchmark comparison, we use data from physical planar grasping experiments. Using the input from a physical experiment to drive the simulation, uncertain model parameters such as friction coefficients are determined. This is repeated for different simulation methods and the parameter estimation error serves as a measure of the suitability of each method to predict the observed physical behavior.
Style APA, Harvard, Vancouver, ISO itp.
2

Alimi, M. H., M. Mahinfalah i G. H. Nazari. "MATLAB in Engineering Education". W ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/cie-21277.

Pełny tekst źródła
Streszczenie:
Abstract One of the most important aspects of engineering education is problem solving. This paper intends to show how MATLAB can be utilized to solve various problems in science and engineering. A simple vibration problem is solved using MATLAB’s ODE solver to illustrate the excellent capability of MATLAB in numerical integration of matrix differential equations.
Style APA, Harvard, Vancouver, ISO itp.
3

Jian, Kuo-Di, i Kendall E. Nygard. "Problem solver for distributed software agent". W SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, redaktorzy Khan M. Iftekharuddin i Abdul Ahad S. Awwal. SPIE, 1999. http://dx.doi.org/10.1117/12.363993.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Bondarev, Aleksandr, i Artem Kuvshinnikov. "Analysis of the behavior of OpenFOAM solvers for 3D problem of supersonic flow around a cone at an angle of attack". W International Conference "Computing for Physics and Technology - CPT2020". Bryansk State Technical University, 2020. http://dx.doi.org/10.30987/conferencearticle_5fce2771320ef0.90086903.

Pełny tekst źródła
Streszczenie:
This paper is devoted to comparative analysis of numerical methods accuracy. Comparative estimation of accuracy is performed for numerical methods presented as solvers integrated to open sotware package OpenFOAM. Three different OpenFOAM solvers are selected to numerically solve the problem of supersonic flow around a cone. The angle of attack, cone half-angle and Mach number were varied in the selected ranges with a certain step. This approach is implemented using a generalized computational experiment that allows, based on parallel technologies, the simultaneous solution of the same basic problem with different input parameters. A number of test calculations were carried out. The deviation fields of gas-dynamic quantities for all solvers are analyzed. The construction of a generalized computational experiment made it possible to compare the accuracy of the considered solvers not only for one, separately taken problem, but for a class of problems specified by the ranges of variation of the determining parameters. Such an assessment of accuracy can be very useful for users of the software package when choosing a solver. Also, the results obtained can be useful for solver developers.
Style APA, Harvard, Vancouver, ISO itp.
5

Lin, Shu, Na Meng i Wenxin Li. "Optimizing Constraint Solving via Dynamic Programming". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/160.

Pełny tekst źródła
Streszczenie:
Constraint optimization problems (COP) on finite domains are typically solved via search. Many problems (e.g., 0-1 knapsack) involve redundant search, making a general constraint solver revisit the same subproblems again and again. Existing approaches use caching, symmetry breaking, subproblem dominance, or search with decomposition to prune the search space of constraint problems. In this paper we present a different approach--DPSolver--which uses dynamic programming (DP) to efficiently solve certain types of constraint optimization problems (COPs). Given a COP modeled with MiniZinc, DPSolver first analyzes the model to decide whether the problem is efficiently solvable with DP. If so, DPSolver refactors the constraints and objective functions to model the problem as a DP problem. Finally, DPSolver feeds the refactored model to Gecode--a widely used constraint solver--for the optimal solution. Our evaluation shows that DPSolver significantly improves the performance of constraint solving.
Style APA, Harvard, Vancouver, ISO itp.
6

Boukhari, Samah, Isma Dahmani i Mhand Hifi. "Local Branching Strategy-Based Method for the Knapsack Problem with Setup". W 4th International Conference on Computer Science and Information Technology (COMIT 2020). AIRCC Publishing Corporation, 2020. http://dx.doi.org/10.5121/csit.2020.101606.

Pełny tekst źródła
Streszczenie:
In this paper, we propose to solve the knapsack problem with setups by combining mixed linear relaxation and local branching. The problem with setups can be seen as a generalization of 0–1 knapsack problem, where items belong to disjoint classes (or families) and can be selected only if the corresponding class is activated. The selection of a class involves setup costs and resource consumptions thus affecting both the objective function and the capacity constraint. The mixed linear relaxation can be viewed as driving problem, where it is solved by using a special blackbox solver while the local branching tries to enhance the solutions provided by adding a series of invalid / valid constraints. The performance of the proposed method is evaluated on benchmark instances of the literature and new large-scale instances. Its provided results are compared to those reached by the Cplex solver and the best methods available in the literature. New results have been reached.
Style APA, Harvard, Vancouver, ISO itp.
7

Afaq, Muhammad Aaqib, Stefan Turek, Abderrahim Ouazzi i Arooj Fatima. "Monolithic Newton-Multigrid Solver for Multiphase Flow Problems with Surface Tension". W VI ECCOMAS Young Investigators Conference. València: Editorial Universitat Politècnica de València, 2021. http://dx.doi.org/10.4995/yic2021.2021.12390.

Pełny tekst źródła
Streszczenie:
We have developed a monolithic Newton-multigrid solver for multiphase flow problems which solves velocity, pressure and interface position simultaneously. The main idea of our work is based on the formulations discussed in [1], where it points out the feasibility of a fully implicit monolithic solver for multiphase flow problems via two formulations, a curvature-free level set approach and a curvature-free cutoff material function approach. Both formulations are fully implicit and have the advantages of requiring less regularity, since neither normals nor curvature are explicitly calculated, and no capillary time restriction. Furthermore, standard Navier-Stokes solvers might be used, which do not have to take into account inhomogeneous force terms. The reinitialization issue is integrated with a nonlinear terms within the formulations.The nonlinearity is treated with a Newton-type solver with divided difference evaluation of the Jacobian matrices. The resulting linearized system inside of the outer Newton solver is a typical saddle point problem which is solved using the geometrical multigrid with Vanka-like smoother using higher order stable FEM pair $Q_2/P^{\text{disc}}_1$ for velocity and pressure and $Q_2$ for all other variables. The method is implemented into an existing software packages for the numerical simulation of multiphase flows (FeatFlow). The robustness and accuracy of this solver is tested for two different test cases, i.e. static bubble and oscillating bubble, respectively [2].REFERENCES[1] Ouazzi, A., Turek, S. and Damanik, H. A curvature-free multiphase flow solver via surface stress-based formulation. Int. J. Num. Meth. Fluids., Vol. 88, pp. 18–31, (2018).[2] Afaq, M. A., Turek, S., Ouazzi, A. and Fatima, A. Monolithic Newton-Multigrid Solver for Multiphase Flow Problems with Surface Tension. Ergebnisberichte des Instituts fuer Angewandte Mathematik Nummer 636, Fakultaet fuer Mathematik, TU Dortmund University, 636, 2021.
Style APA, Harvard, Vancouver, ISO itp.
8

Inie, Nanna, Allison Endo, Steven Dow i Peter Dalsgaard. "The problem solver and the artisan designer". W NordiCHI'18: Nordic Conference on Human-Computer Interaction. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3240167.3240215.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Fujii, N., R. Inoue i J. Ota. "Multiple robot rearrangement problem using an extended project-scheduling problem solver". W 2008 IEEE International Conference on Robotics and Biomimetics. IEEE, 2009. http://dx.doi.org/10.1109/robio.2009.4913309.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Ren, Guotong, i Rami M. Younis. "A Time-Continuation Solver for Hydraulic Fracture Propagation". W SPE Reservoir Simulation Conference. SPE, 2021. http://dx.doi.org/10.2118/203937-ms.

Pełny tekst źródła
Streszczenie:
Abstract We present an efficient time-continuation scheme for fluid-driven fracture propagation problems in the frame-work of the extended finite element method (XFEM). The fully coupled, fully implicit hydro-mechanical system is solved in conjunction with the linear elastic fracture propagation criterion by the Newton-Raphson method. Therefore, at the end of each time-step solve, the model ensures the energy release rate of weakest fracture tips within the equilibrium propagation regime. Besides, an initialization procedure for newly created fracture space as well as a priori estimate of stress intensity factor (SIF) growth rates are also developed to further improve the solver performance. We validate the model by the analytical solution and extend the problem to the multiple fracture propagation where stress shadow phenomenon occur.
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Problem Solver"

1

Simon, Herbert A. The Scientist as Problem Solver. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1987. http://dx.doi.org/10.21236/ada204681.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Simon, Herbert A. The Scientist as Problem Solver. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1989. http://dx.doi.org/10.21236/ada240569.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Hooper, Russell, i Stan Gerald Moore. Aleph Field Solver Challenge Problem Results Summary. Office of Scientific and Technical Information (OSTI), styczeń 2015. http://dx.doi.org/10.2172/1168984.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Kolodner, Janet L. Extending Problem Solver Capabilities through Case-Based Inference. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1987. http://dx.doi.org/10.21236/ada191332.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Marshall, Sandra P., Kathryn E. Barthuli, Margaret A. Brewer i Frederic E. Rose. Story Problem Solver: A Schema-Based System of Instruction. Fort Belvoir, VA: Defense Technical Information Center, luty 1989. http://dx.doi.org/10.21236/ada205594.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Apostolatos, A., R. Rossi i C. Soriano. D7.2 Finalization of "deterministic" verification and validation tests. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.006.

Pełny tekst źródła
Streszczenie:
This deliverable focus on the verification and validation of the solvers of Kratos Multiphysics which are used within ExaQUte. These solvers comprise standard body-fitted approaches and novel embedded approaches for the Computational Fluid Dynamics (CFD) simulations carried out within ExaQUte. Firstly, the standard body-fitted CFD solver is validated on a benchmark problem of high rise building - CAARC benchmark and subsequently the novel embedded CFD solver is verified against the solution of the body-fitted solver. Especially for the novel embedded approach, a workflow is presented on which the exact parameterized Computer-Aided Design (CAD) model is used in an efficient manner for the underlying CFD simulations. It includes: A note on the space-time methods Verification results for the body-fitted solver based on the CAARC benchmark Workflow consisting of importing an exact CAD model, tessellating it and performing embedded CFD on it Verification results for the embedded solver based on a high-rise building API definition and usage
Style APA, Harvard, Vancouver, ISO itp.
7

Klenk, Matthew, i Ken Forbus. Measuring the Level of Transfer Learning by an AP Physics Problem-Solver. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2007. http://dx.doi.org/10.21236/ada470405.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Baader, Franz, Pavlos Marantidis i Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.

Pełny tekst źródła
Streszczenie:
Unification with constants modulo the theory ACUI of an associative (A), commutative (C) and idempotent (I) binary function symbol with a unit (U) corresponds to solving a very simple type of set equations. It is well-known that solvability of systems of such equations can be decided in polynomial time by reducing it to satisfiability of propositional Horn formulae. Here we introduce a modified version of this problem by no longer requiring all equations to be completely solved, but allowing for a certain number of violations of the equations. We introduce three different ways of counting the number of violations, and investigate the complexity of the respective decision problem, i.e., the problem of deciding whether there is an assignment that solves the system with at most l violations for a given threshold value l.
Style APA, Harvard, Vancouver, ISO itp.
9

Lindquist, Joachim, i Henning de Haas. Creating Supply Chain Resilience Through Scenario Planning: How a Digital Twin Can Be Used To Enhance Supply Chain Resilience Through Scenario Planning. Aarhus University Library, 2021. http://dx.doi.org/10.7146/aul.435.

Pełny tekst źródła
Streszczenie:
This book focusses on the concept of supply chain disruptions and how supply chain resilience can contribute to both preparing for and reacting to the event causing disruption. For building a digital twin of a supply chain, a software named Supply Chain Guru has been used. The software is a supply chain design tool which can be used for different kinds of supply chain network optimisation. The book outlines four scenarios: Covid-19 lockdown, Brexit without deal, Conflagration at a dairy and Political regulations on transport. The scenarios all contain a problem that needs to be solved. This problem is considered as the main disruption for the supply chain. Running the scenario in Supply Chain Guru, constraints are added to the AS-IS model. The constraints are identified as implications of the event in the scenarios. By adding the constraints and running the model, Supply Chain Guru identifies suggestions to solve the problems which were described. The solutions within the scenarios are held up against the theory of supply chain resilience, to describe how the scenario planning can be used to enhance supply chain resilience. Finally, the book discuss how scenario planning can be related to supply chain resilience as well as how scenario planning can be used to increase supply chain resilience.
Style APA, Harvard, Vancouver, ISO itp.
10

Samji, Salimah, i Mansi Kapoor. Funda Wande through the Lens of PDIA: Showcasing a Flexible and Iterative Learning Approach to Improving Educational Outcomes. Research on Improving Systems of Education (RISE), styczeń 2022. http://dx.doi.org/10.35489/bsg-rise-ri_2022/036.

Pełny tekst źródła
Streszczenie:
Funda Wande has adopted a ‘learning by doing’ strategy that is similar to the Problem Driven Iterative Adaptation (PDIA) approach to solving complex problems. PDIA is a high-impact process of innovation that helps organisations develop the capability to solve complex problems while they are solving such problems. It is a step-by-step framework that helps break down problems into their root causes, identify entry points, search for possible solutions, take action, reflect upon what is learned, adapt, and then act again. Its dynamic process and tight feedback loops enable teams to find and fit solutions to the local context. This case provides a narrative of the Funda Wande story with boxes illustrating how PDIA principles and tools like problem construction, deconstruction, entry point analysis, iteration, and building authorisation would have been applied in practice. The sources of this case include a literature review of education in South Africa, related research documents, and conversations with staff at Funda Wande.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Problem Solver” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii