Relevant bibliographies by topics / Search problems

Academic literature on the topic 'Search problems'

Author: Grafiati
Published: 4 June 2021
Last updated: 31 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Search problems.'

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.

Journal articles on the topic "Search problems"

1

Ryan, J. D., Rudolf Ahlswede, and Ingold Wegener. "Search Problems." Journal of the Operational Research Society 39, no. 10 (October 1988): 977. http://dx.doi.org/10.2307/2583050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dykstra, Richard, Rudolph Ahlswede, Ingo Wegener, and Jean E. Wotschke. "Search Problems." Journal of the American Statistical Association 84, no. 406 (June 1989): 627. http://dx.doi.org/10.2307/2289975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ryan, J. D. "Search Problems." Journal of the Operational Research Society 39, no. 10 (October 1988): 977–78. http://dx.doi.org/10.1057/jors.1988.165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cannings, C., R. Ahlswede, and I. Wegener. "Search Problems." Statistician 37, no. 4/5 (1988): 483. http://dx.doi.org/10.2307/2348782.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kummer, Martin, and Frank Stephan. "Effective Search Problems." Mathematical Logic Quarterly 40, no. 2 (1994): 224–36. http://dx.doi.org/10.1002/malq.19940400209.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lunegov, S. V., and N. N. Petrov. "Search Problems on Graphs." IFAC Proceedings Volumes 34, no. 6 (July 2001): 969–71. http://dx.doi.org/10.1016/s1474-6670(17)35307-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hinderer, Karl, and Michael Stieglitz. "On polychotomous search problems." European Journal of Operational Research 73, no. 2 (March 1994): 279–94. http://dx.doi.org/10.1016/0377-2217(94)90265-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aigner, M. "Search problems on graphs." Discrete Applied Mathematics 14, no. 3 (July 1986): 215–30. http://dx.doi.org/10.1016/0166-218x(86)90026-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Neledva, N., and S. Linenko. "GENERAL PROBLEMS OF SUSPECT SEARCH." “International Humanitarian University Herald. Jurisprudence”, no. 50 (2021): 100–103. http://dx.doi.org/10.32841/2307-1745.2021.50.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Prough, Donald S., and Mark H. Zornow. "Solutions in search of problems." Critical Care Medicine 24, no. 7 (July 1996): 1104–5. http://dx.doi.org/10.1097/00003246-199607000-00006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Search problems"

1

Lim, Wei Shi. "Problems in rendezvous search." Thesis, London School of Economics and Political Science (University of London), 1996. http://etheses.lse.ac.uk/2457/.

Full text
Abstract:
Suppose n players are placed randomly on the real line at consecutive integers, and faced in random directions. Each player has maximum speed one and cannot see the others. The least expected time required for m(? n) of them to meet together at a single point, if all players have to use the same strategy, is the symmetric rendezvous value Rsm,n. If the players can use different strategies, the least expected meeting time is the asymmetric rendezvous value Ram,n. show that Ra3,2 is 47/48 and Rsn,n is asymptotic to n/2. If the minimax rendezvous time Mn is the minimum time required to ensure that all players can meet together at a single point regardless of their initial placement, we prove that M2 is 3, M3 is 4 and Mn is asymptotic to n/2. If players have to stick together upon meeting, we prove that three players require 5 time units to ensure a meeting. We also consider a problem proposed by S. Alpern (in his joint paper with A. Beck, Rendezvous Search on the Line with Bounded Resources, LSE Math Preprint Series, 92 (1995)) of how two players can optimally rendezvous while at the same time evading an enemy searcher. We model this rendezvous-evasion problem as a two-person, zero-sum game between the rendezvous team R (with agents R1, R2) and the searcher S and consider a version which is discrete in time and space. R1, R2 and S start at different locations among n identical locations and no two of them share a common labelling of the locations. Each player can move between any two locations in one time step (this includes the possibility of staying still) until at least two of them are at the same location together, at which time the game ends. If S is at this location, S (maximizer) wins and the payoff is 1; otherwise the team R (minimizer) wins and the payoff is 0. The value of the game vn is the probability that S wins under optimal play. We assume that R1 and R2 can jointly randomize their strategies and prove that V3 is 47/76 ? 0.61842 and v4 is at least 31/54 ? 0.57407. If all the players share a common notion of a directed cycle containing all the n locations (while still able to move between any two locations), the value of the game dn is ((1 - 2/n)n-1 + l)/2. In particular, d3 is less than v3 and d4 is less than v4. We also compare some of these results with those obtained when the rendezvous-evasion game is modelled as a multi-stage game with observed actions (W. S. Lim, Rendezvous-Evasion As a Multi-Stage Game With Observed Actions, LSE Math-CDAM Research Report Series, 96-05 (1996)). In all instances considered, we find that obligatory announcement of actions at the end of each step either does not affect the value of the game or helps the rendezvous team secure a lower value.
APA, Harvard, Vancouver, ISO, and other styles
2

Black, Daniel Peter. "Search in weighted constraint satisfaction problems." Thesis, University of Leeds, 2003. http://etheses.whiterose.ac.uk/1309/.

Full text
Abstract:
A wide variety of real-world optimisation problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). Such problems are NP-hard and require an exponential amount of time to find the optimal solution. This thesis concentrates on the University Examination Timetabling Problem. A general abstraction of this problem has been used, as there are many institution-specific rules which could be incorporated into the problem. The use of this problem type allows WCSPs to be investigated using realistic problem data and allows a comparison with previously published results for the problem instances used. We have examined some existing variable ordering heuristics and defined new ones. An analysis methodology has been defined that allows the characteristics of good solutions to be identified. Different methods of identifying difficult to solve sub-problems and the use of such methods in variable ordering has been investigated. Incorporating the weight, or preference, associated with constraints into variable ordering heuristics has been found to be beneficial to finding solutions of low cost. The analysis methodology has been used to examine the relationship between solutions of different quality and the knowledge derived has been used to define, and justify, two new variable ordering heuristics. The usefulness of different value ordering heuristics has been examined. Value selection on the error incurred with past assignments and the use of look-ahead have been investigated. Variable ordering heuristics have been extended to try and exploit the advantages of such value ordering heuristics. The use of stochasticity with such orderings has been investigated and has led to a new class of hybrid value ordering heuristics being defined. Finally two hybrid search algorithms have been defined that attempt to concentrate search upon the sections of the problem instance which have the largest effect upon the overall quality of solutions found. Such methods are shown to be at least competitive with standard tree based search techniques.
APA, Harvard, Vancouver, ISO, and other styles
3

Arbelaez, Rodriguez Alejandro. "Learning during search." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00600523.

Full text
Abstract:
La recherche autonome est un nouveau domaine d'intérêt de la programmation par contraintes, motivé par l'importance reconnue de l'utilisation de l'apprentissage automatique pour le problème de sélection de l'algorithme le plus approprié pour une instance donnée, avec une variété d'applications, par exemple: Planification, Configuration d'horaires, etc. En général, la recherche autonome a pour but le développement d'outils automatiques pour améliorer la performance d'algorithmes de recherche, e.g., trouver la meilleure configuration des paramètres pour un algorithme de résolution d'un problème combinatoire. Cette thèse présente l'étude de trois points de vue pour l'automatisation de la résolution de problèmes combinatoires; en particulier, les problèmes de satisfaction de contraintes, les problèmes d'optimisation de combinatoire, et les problèmes de satisfiabilité (SAT).Tout d'abord, nous présentons domFD, une nouvelle heuristique pour le choix de variable, dont l'objectif est de calculer une forme simplifiée de dépendance fonctionnelle, appelée dépendance-relaxée. Ces dépendances-relaxées sont utilisées pour guider l'algorithme de recherche à chaque point de décision.Ensuite, nous révisons la méthode traditionnelle pour construire un portefeuille d'algorithmes pour le problème de la prédiction de la structure des protéines. Nous proposons un nouveau paradigme de recherche-perpétuelle dont l'objectif est de permettre à l'utilisateur d'obtenir la meilleure performance de son moteur de résolution de contraintes. La recherche-perpétuelle utilise deux modes opératoires: le mode d'exploitation utilise le modèle en cours pour solutionner les instances de l'utilisateur; le mode d'exploration réutilise ces instances pour s'entraîner et améliorer la qualité d'un modèle d'heuristiques par le biais de l'apprentissage automatique. Cette deuxième phase est exécutée quand l'unité de calcul est disponible (idle-time). Finalement, la dernière partie de cette thèse considère l'ajout de la coopération au cours d'exécution d'algorithmes de recherche locale parallèle. De cette façon, on montre que si on partage la meilleure configuration de chaque algorithme dans un portefeuille parallèle, la performance globale peut être considérablement amélioré.
APA, Harvard, Vancouver, ISO, and other styles
4

Korneffel, Torsten. "On combinatorial search problems which involve graphs." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=984062386.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Voudouris, Christos. "Guided local search for combinatorial optimisation problems." Thesis, University of Essex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Marett, Richard Colin. "Neighbourhood search techniques for multi-objective combinatorial problems." Thesis, Lancaster University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zahrani, Mohammed Saeed. "Genetic local search algorithms for selected graph problems." Thesis, University of Hertfordshire, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lamprou, I. "Mobility problems in distributed search and combinatorial games." Thesis, University of Liverpool, 2018. http://livrepository.liverpool.ac.uk/3028459/.

Full text
Abstract:
This thesis examines a collection of topics under the general notion of mobility of agents. We examine problems where a set of entities, perceived as robots or tokens, navigate in some given (discrete or continuous) environment to accomplish a goal. The problems we consider fall under two main research fields. First, Distributed Search where the agents cooperate to explore their environment or search for a specific target location within it. Second, Combinatorial Games, in the spirit of Pursuit-Evasion, where the agents are now divided into two groups with complementary objectives competing against each other. More specifically, we consider three distinct problems: disk evacuation, exploration of dynamic graphs and eternal domination. In Disk Evacuation, two robots with different speeds aim to discover an unknown exit lying on the boundary of a unit disk. For a wide range of speeds, we provide matching upper and lower bounds. In Dynamic Graph Exploration, we analyze the exploration time for a randomly-walking agent wishing to visit all the vertices of a stochastically-evolving graph. In Eternal Domination, we consider rectangular grid graphs and upper bound the amount of guard agents needed to perpetually defend the vertices against an attacker.
APA, Harvard, Vancouver, ISO, and other styles
9

Lopez, Soto Claudia Orquidea. "Formulation space search for two-dimensional packing problems." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7455.

Full text
Abstract:
The two-dimension packing problem is concerned with the arrangement of items without overlaps inside a container. In particular we have considered the case when the items are circular objects, some of the general examples that can be found in the industry are related with packing, storing and transportation of circular objects. Although there are several approaches we want to investigate the use of formulation space search. Formulation space search is a fairly recent method that provides an easy way to escape from local optima for non-linear problems allowing to achieve better results. Despite the fact that it has been implemented to solve the packing problem with identical circles, we present an improved implementation of the formulation space search that gives better results for the case of identical and non-identical circles, also considering that they are packed inside different shaped containers, for which we provide the needed modifications for an appropriate implementation. The containers considered are: the unit circle, the unit square, two rectangles with different dimension (length 5, width 1 and length 10 width 1), a right-isosceles triangle, a semicircle and a right-circular quadrant. Results from the tests conducted shown several improvements over the best previously known for the case of identical circles inside three different containers: a right-isosceles triangle, a semicircle and a circular quadrant. In order to extend the scope of the formulation space search approach we used it to solve mixed-integer non-linear problems, in particular those with zero-one variables. Our findings suggest that our implementation provides a competitive way to solve these kind of problems.
APA, Harvard, Vancouver, ISO, and other styles
10

Buljubasic, Mirsad. "Efficient local search for several combinatorial optimization problems." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS010/document.

Full text
Abstract:
Cette thèse porte sur la conception et l'implémentation d'algorithmes approchés pour l'optimisation en variables discrètes. Plus particulièrement, dans cette étude nous nous intéressons à la résolution de trois problèmes combinatoires difficiles : le « Bin-Packing », la « Réaffectation de machines » et la « Gestion des rames sur les sites ferroviaires ». Le premier est un problème d'optimisation classique et bien connu, tandis que les deux autres, issus du monde industriel, ont été proposés respectivement par Google et par la SNCF. Pour chaque problème, nous proposons une approche heuristique basée sur la recherche locale et nous comparons nos résultats avec les meilleurs résultats connus dans la littérature. En outre, en guise d'introduction aux méthodes de recherche locale mise en œuvre dans cette thèse, deux métaheuristiques, GRASP et Recherche Tabou, sont présentées à travers leur application au problème de la couverture minimale
This Ph.D. thesis concerns algorithms for Combinatorial Optimization Problems. In Combinatorial Optimization Problems the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution. Specifically, in this research we consider three different problems in the field of Combinatorial Optimization including One-dimensional Bin Packing (and two similar problems), Machine Reassignment Problem and Rolling Stock Problem. The first one is a classical and well known optimization problem, while the other two are real world and very large scale problems arising in industry and have been recently proposed by Google and French Railways (SNCF) respectively. For each problem we propose a local search based heuristic algorithm and we compare our results with the best known results in the literature. Additionally, as an introduction to local search methods, two metaheuristic approaches, GRASP and Tabu Search are explained through a computational study on Set Covering Problem
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Search problems"

1

Ahlswede, Rudolf. Search problems. Chichester [West Sussex]: Wiley, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Search problems. Chichester: Wiley, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kearfott, R. Baker. Rigorous global search: Continuous problems. Dordrecht: Kluwer Academic Publishers, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kearfott, R. Baker. Rigorous Global Search: Continuous Problems. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-2495-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wassenhove, Luk N. van. Statistical search methods for lotsizing problems. Fontainebleau: INSEAD, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fischer, S. T. The solution sets of local search problems. Amsterdam: [S. n.], 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Barlevy, Gadi. Identification of search models with initial condition problems. Chicago, Ill.]: Federal Reserve Bank of Chicago, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Barlevy, Gadi. Identification of search models with initial condition problems. Bonn, Germany: IZA, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Barlevy, Gadi. Identification of search models with initial condition problems. Cambridge, Mass: National Bureau of Economic Research, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kurt, Cylke F., ed. Social problems--the search for solutions: An anthology. Los Angeles, Calif: Roxbury Pub. Co., 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Search problems"

1

Izadkhah, Habib. "Search." In Problems on Algorithms, 269–88. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17043-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hazay, Carmit, and Yehuda Lindell. "Search Problems." In Efficient Secure Two-Party Protocols, 227–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14303-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ghédira, Khaled, and Bernard Dubuisson. "Search Heuristics." In Constraint Satisfaction Problems, 99–120. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118574522.ch4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maier, Gunther. "Tractable Spatial Search Problems." In Spatial Search, 99–137. Heidelberg: Physica-Verlag HD, 1995. http://dx.doi.org/10.1007/978-3-642-49346-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Spirtes, Peter, Clark Glymour, and Richard Scheines. "Open Problems." In Causation, Prediction, and Search, 354–66. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4612-2748-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fokkink, Robbert, Leonhard Geupel, and Kensaku Kikuta. "Open Problems on Search Games." In Search Theory, 75–81. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6825-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alpern, Steve. "Ten Open Problems in Rendezvous Search." In Search Theory, 223–30. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6825-7_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Battiti, Roberto, Franco Mascia, and Mauro Brunato. "Open Problems." In Reactive Search and Intelligent Optimization, 1–3. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-09624-7_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Köbler, Johannes, Uwe Schöning, and Jacobo Torán. "Decision Problems, Search Problems, and Counting Problems." In The Graph Isomorphism Problem, 11–50. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0333-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pitchford, Jon. "Applications of Search in Biology: Some Open Problems." In Search Theory, 295–303. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6825-7_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Search problems"

1

Croft, W. Bruce. "Unsolved problems in search." In Proceeding of the 17th ACM conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1458082.1458085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Steitz, Wolfgang, and Franz Rothlauf. "Solving OCST problems with problem-specific guided local search." In the 12th annual conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1830483.1830541.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Beimel, Amos, Paz Carmi, Kobbi Nissim, and Enav Weinreb. "Private approximation of search problems." In the thirty-eighth annual ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1132516.1132533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hatamlou, Abdolreza, Salwani Abdullah, and Zalinda Othman. "Gravitational search algorithm with heuristic search for clustering problems." In 2011 3rd Conference on Data Mining and Optimization (DMO). IEEE, 2011. http://dx.doi.org/10.1109/dmo.2011.5976526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Natalia, Bakhtadze,. "Associative Search Models in Power Grids." In Information Control Problems in Manufacturing, edited by Bakhtadze, Natalia, Chair Dolgui, Alexandre and Bakhtadze, Natalia. Elsevier, 2009. http://dx.doi.org/10.3182/20090603-3-ru-2001.00286.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Deb, Suash, Simon Fong, and Zhonghuan Tian. "Elephant Search Algorithm for optimization problems." In 2015 Tenth International Conference on Digital Information Management (ICDIM). IEEE, 2015. http://dx.doi.org/10.1109/icdim.2015.7381893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

NG, MICHAEL K. "CLUSTERING PROBLEMS USING TABU SEARCH TECHNIQUES." In Proceedings of the International Conference on Inverse Problems. WORLD SCIENTIFIC, 2003. http://dx.doi.org/10.1142/9789812704924_0034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Macià, Núria, Albert Orriols-Puig, and Ester Bernadó-Mansilla. "In search of targeted-complexity problems." In the 12th annual conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1830483.1830674.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jing, Wang, Jiang Wei, Cao Liulin, Jin Qibing, and Wang Wei. "A dynamical search space harmony search for unconstrained optimization problems." In 2013 9th Asian Control Conference (ASCC). IEEE, 2013. http://dx.doi.org/10.1109/ascc.2013.6606037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Thoma, U. "The search for missing baryon resonances." In FEW-BODY PROBLEMS IN PHYSICS: The 19th European Conference on Few-Body Problems in Physics. AIP, 2005. http://dx.doi.org/10.1063/1.1932910.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Search problems"

1

Bolonkin, Alexander A., and James R. Cloutier. Search, Observation, and Attack Problems. Fort Belvoir, VA: Defense Technical Information Center, July 2002. http://dx.doi.org/10.21236/ada410927.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bowman, Jason, and Jeff Dubois. Probability-Of-Opportunity for Airborne Search Problems. Fort Belvoir, VA: Defense Technical Information Center, October 2008. http://dx.doi.org/10.21236/ada491403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Washburn, Alan R. Branch and Bound Methods for Search Problems. Fort Belvoir, VA: Defense Technical Information Center, April 1995. http://dx.doi.org/10.21236/ada294522.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Barlevy, Gadi, and H. N. Nagaraja. Identification of Search Models with Initial Condition Problems. Cambridge, MA: National Bureau of Economic Research, April 2006. http://dx.doi.org/10.3386/w12166.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abramson, Mark A., Charles Audet, Jr Dennis, and J. E. Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems. Fort Belvoir, VA: Defense Technical Information Center, June 2004. http://dx.doi.org/10.21236/ada445031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hough, P. D. Stable computation of search directions for near-degenerate linear programming problems. Office of Scientific and Technical Information (OSTI), March 1997. http://dx.doi.org/10.2172/477537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Homaifar, Abdollah, Albert Esterline, and Bahram Kimiaghalam. Hybrid Projected Gradient-Evolutionary Search Algorithm for Mixed Integer Nonlinear Optimization Problems. Fort Belvoir, VA: Defense Technical Information Center, April 2005. http://dx.doi.org/10.21236/ada455904.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Samji, Salimah, and 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), January 2022. http://dx.doi.org/10.35489/bsg-rise-ri_2022/036.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
9

Shing, Man-Tak, and Michael M. Mayer. Persistence Search - A New Search Strategy for the Dynamic Shortest Path Problem. Fort Belvoir, VA: Defense Technical Information Center, April 1991. http://dx.doi.org/10.21236/ada238741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pforr, Tobias, Fabian Pape, and Steffen Murau. After the Allocation: What Role for the Special Drawing Rights System? Institute for New Economic Thinking Working Paper Series, March 2022. http://dx.doi.org/10.36687/inetwp180.

Full text
Abstract:
In August 2021, the IMF made a new SDR allocation to help ease pandemic-induced financial strains in the Global South. This paper assesses the potential of the SDR system to address debtrelated problems in global finance. We analyze the SDR system as a web of interlocking balance sheets whose members can use SDR holdings—the system’s tradable assets—for conversion into usable currency as a perpetual low-interest loan or to make payments to each other. Using original IMF data, we study how the system has been practically used since 1990. Though widely perceived as a solution in search of a problem in the post-Bretton Woods era, we find that the SDR system provides three mechanisms through which IMF members borrow and lend usable currency to each other, with different strings attached: first, transactions by agreement; second, the IMF’s core lending facilities for which the SDR system offers additional resources; and third, IMF-sponsored Trusts which seek to harness the SDR system for development purposes and are the basis for the current idea of ‘voluntary channeling’. Overall, given the SDR system’s idiosyncratic accounting rules, the new allocation can improve the liquidity position of a country and offer some limited avenues for sovereign debt restructuring but comes with new interest and exchange rate risks. Voluntary channeling cannot happen without a wealth transfer, neither the SDR allocation nor the use of Trusts can overcome this problem. Still, Trusts can be a useful instrument to help with debt forgiveness and to ensure that borrowed funds are used for their intended purpose.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Search problems' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography