Search results for "best-first"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
52	Dennis M. Breuker, H. Jaap van den Herik, Jos W. H. M. Uiterwijk, L. Victor Allis	A Solution to the GHI Problem for Best-First Search.	Computers and Games	1998	DBLP DOI BibTeX RDF	graph-history interaction (GHI) problem, base-twin algorithm (BTA), best-first search
38	Dexter Whitlock, Pradip Dey, Robert Hyatt	A parallel best-first search.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
38	Myung K. Yang, Chita R. Das	Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	parallel branch-and-bound algorithm, MIN-based multiprocessorsystems, serial best-first search, conflict-free mapping scheme, performance evaluation, parallel algorithms, multiprocessor interconnection networks, multiprocessing systems, probabilistic model, communication overheads, computation overheads
32	Hanan Samet	K-Nearest Neighbor Finding Using MaxNearestDist.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF	depth-first nearest neighbor finding, best-first nearest neighbor finding, similarity searching, k-nearest neighbors, metric spaces
32	Chee Fen Yu, Benjamin W. Wah	Efficient Branch-and-Bound Algorithms on a Two-Level Memory System.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	two-level memory system, storage management, virtual-memory, storage allocation, depth-first search, branch-and-bound algorithms, virtual storage, best-first search
31	Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald	Frontier search.	J. ACM	2005	DBLP DOI BibTeX RDF	bidirectional search, sliding-tile puzzles, heuristic search, sequence alignment, Dijkstra's algorithm, breadth-first search, best-first search, A* algorithm, Towers of Hanoi
30	Thomas R. Lincke	Strategies for the Automatic Construction of Opening Books.	Computers and Games	2000	DBLP DOI BibTeX RDF	opening book construction, expansion strategy, best-first, Awari, Othello
28	Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson	Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
28	Jens Clausen, Michael Perregaard	On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search.	Ann. Oper. Res.	1999	DBLP DOI BibTeX RDF
28	Ariel Felner, Roni Stern, Jeffrey S. Rosenschein, Alex Pomeransky	Searching for close alternative plans.	Auton. Agents Multi Agent Syst.	2007	DBLP DOI BibTeX RDF	Scheduling, Shortest path, Rescheduling, Best-first search, Replanning
28	Swarup Mandal, Debashis Saha, Sougata Bera, Shubhadip Ray, Ambuj Mahanti	An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks.	IWDC	2003	DBLP DOI BibTeX RDF	Survivable WDM Optical Network, Lightpath, Best-First Search
27	Moa Johansson, Alan Bundy, Lucas Dixon	Best-First Rippling.	Reasoning, Action and Interaction in AI Theories and Systems	2006	DBLP DOI BibTeX RDF
27	Reijer Grimbergen	A Survey of Tsume-Shogi Programs Using Variable-Depth Search.	Computers and Games	1998	DBLP DOI BibTeX RDF	Variable-depth search, conspiracy-number search, tsume shogi, game playing, best-first search
27	Alexander Reinefeld, T. Anthony Marsland	Enhanced Iterative-Deepening Search.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	iterative-deepening search, breadth-first node expansion, successively extended search horizons, information management techniques, fast-execution memory functions, computational complexity, game theory, iterative methods, search problems, space complexity, depth-first searches, A* search, search efficiency, best-first searches, two-player games
26	Muhammad Kafil, Ishfaq Ahmad	Optimal task assignment in heterogeneous computing systems.	Heterogeneous Computing Workshop	1997	DBLP DOI BibTeX RDF	optimal task assignment, best-first search technique, assignment algorithm, distributed systems, computational complexity, artificial intelligence, high-performance computing, NP-hard, time complexity, clustering technique, search technique, heuristic techniques, heterogeneous computing systems
25	Shujun Zhang, Geoffrey D. Sullivan, Keith D. Baker	The Automatic Construction of a View-Independent Relational Model for 3-D Object Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	view-independent relational model, single monochromatic images, statistical interference, primitive 2-D features, hyperedges, procedural constraints, covisibility measures, computer vision, graph theory, CAD, statistics, spatial reasoning, spatial reasoning, hypergraph, relational model, vision system, CAD model, geometric reasoning, best-first search, 3-D object recognition
23	Bennet Uk, Michela Taufer, Thomas Stricker, Giovanni Settanni, Andrea Cavalli, Amedeo Caflisch	Combining Task- and Data Parallelism to Speed up Protein Folding on a Desktop Grid Platform.	CCGRID	2003	DBLP DOI BibTeX RDF	data and task parallelism, CHARMM, United Devices MetaProcessor, computational grid, Protein folding, best-first search
23	Jonathan Schaeffer, Aske Plaat	New Advances in Alpha-Beta Searching.	ACM Conference on Computer Science	1996	DBLP DOI BibTeX RDF	Alpha-Beta, SSS*, heuristic search, best-first search, computer chess
22	Manuel Heusner, Thomas Keller 0001, Malte Helmert	Best-Case and Worst-Case Behavior of Greedy Best-First Search.	IJCAI	2018	DBLP DOI BibTeX RDF
21	Radu Marinescu 0002, Rina Dechter	Best-First AND/OR Search for 0/1 Integer Programming.	CPAIOR	2007	DBLP DOI BibTeX RDF
20	Martin Sachenbacher, Brian C. Williams	On-Demand Bound Computation for Best-First Constraint Optimization.	CP	2004	DBLP DOI BibTeX RDF
20	Ziyu Chen, Chen He, Zhen He, Minyou Chen	BD-ADOPT: a hybrid DCOP algorithm with best-first and depth-first search strategies.	Artif. Intell. Rev.	2018	DBLP DOI BibTeX RDF
20	Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin	Best-First and Depth-First Minimax Search in Practice.	CoRR	2015	DBLP BibTeX RDF
20	Radu Marinescu 0002	Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization.	ICTAI (1)	2010	DBLP DOI BibTeX RDF
20	Andreas Auer, Hermann Kaindl	A Case Study of Revisiting Best-First vs. Depth-First Search.	ECAI	2004	DBLP BibTeX RDF
20	Weixiong Zhang, Richard E. Korf	Depth-First vs. Best-First Search: New Results.	AAAI	1993	DBLP BibTeX RDF
20	Subir Bhattacharya, Amitava Bagchi	QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies.	IWAR	1992	DBLP BibTeX RDF
20	Nageshwara Rao Vempaty, Vipin Kumar 0001, Richard E. Korf	Depth-First Versus Best-First Search.	AAAI	1991	DBLP BibTeX RDF
19	Tomoyuki Hamamura, Takuma Akagi, Bunpei Irie	Bayesian Best-First Search for Pattern Recognition - Application to Address Recognition.	ICDAR	2009	DBLP DOI BibTeX RDF
19	Rüdiger Ebendt, Wolfgang Günther 0001, Rolf Drechsler	Combining ordered best-first search with branch and bound for exact BDD minimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF
19	Rüdiger Ebendt, Wolfgang Günther 0001, Rolf Drechsler	Combining ordered best-first search with branch and bound for exact BDD minimization.	ASP-DAC	2004	DBLP DOI BibTeX RDF
19	Andy C. Downton, Simon M. Lucas, L. Du	Lazy Evaluation for Best-First Contextual Handwriting Recognition.	ICDAR	1999	DBLP DOI BibTeX RDF
19	Rina Dechter, Judea Pearl	Generalized Best-First Search Strategies and the Optimality of A*	J. ACM	1985	DBLP DOI BibTeX RDF
18	Rüdiger Ebendt, Rolf Drechsler	Quasi-Exact BDD Minimization Using Relaxed Best-First Search.	ISVLSI	2005	DBLP DOI BibTeX RDF
18	Daniel Szer, François Charpillet	An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs.	ECML	2005	DBLP DOI BibTeX RDF
16	Abdelkader Sbihi	A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Combinatorial optimization, Branch and bound, Knapsack, Sequential algorithm
16	Sang-Yule Choi, Myong-Chul Shin, Jae Sang Cha	Loss Reduction in Distribution Networks Using Cyclic Best First Search.	ICCSA (5)	2006	DBLP DOI BibTeX RDF
16	Simon M. Lucas	Efficient Best-First Dictionary Search Given Graph-Based Input.	ICPR	2000	DBLP DOI BibTeX RDF
16	Marc Gengler, Giovanni Coray	A Parallel Best-First B&B with Synchronization Phases.	CONPAR	1992	DBLP DOI BibTeX RDF
14	Saqib Ameen, Levi H. S. Lelis	Program Synthesis with Best-First Bottom-Up Search (Abstract Reprint).	AAAI	2024	DBLP DOI BibTeX RDF
14	Ailian Wang, Jing Pan, Caihong Jiang, Jia Jin	Create the best first glance: The cross-cultural effect of image background on purchase intention.	Decis. Support Syst.	2023	DBLP DOI BibTeX RDF
14	Jingyun Gui, Leandro Rafael Alejano, Miao Yao, Fasuo Zhao, Wei Chen	GIS-Based Landslide Susceptibility Modeling: A Comparison between Best-First Decision Tree and Its Two Ensembles (BagBFT and RFBFT).	Remote. Sens.	2023	DBLP DOI BibTeX RDF
14	Saqib Ameen, Levi H. S. Lelis	Program Synthesis with Best-First Bottom-Up Search.	J. Artif. Intell. Res.	2023	DBLP DOI BibTeX RDF
14	Saqib Ameen, Levi H. S. Lelis	Program Synthesis with Best-First Bottom-Up Search.	CoRR	2023	DBLP DOI BibTeX RDF
14	Jannis Limperg, Asta Halkjær From	Aesop: White-Box Best-First Proof Search for Lean.	CPP	2023	DBLP DOI BibTeX RDF
14	Frederico Messa, André Grahl Pereira	A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution Size.	ICAPS	2023	DBLP DOI BibTeX RDF
14	Takumi Shimoda, Alex Fukunaga	Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search.	SOCS	2023	DBLP DOI BibTeX RDF
14	Hebatullah Khattab, Basel A. Mahafzah, Ahmad Abdel-Aziz Sharieh	A hybrid algorithm based on modified chemical reaction optimization and best-first search algorithm for solving minimum vertex cover problem.	Neural Comput. Appl.	2022	DBLP DOI BibTeX RDF
14	Didier El Baz, Bilal Fakih, Romeo Sanchez Nigenda, Vincent Boyer 0002	Parallel best-first search algorithms for planning problems on multi-core processors.	J. Supercomput.	2022	DBLP DOI BibTeX RDF
14	Shinsaku Sakaue, Taihei Oki	Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search.	CoRR	2022	DBLP DOI BibTeX RDF
14	Dieqiao Feng, Carla P. Gomes, Bart Selman	Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning.	CoRR	2022	DBLP DOI BibTeX RDF
14	Joseph Akinwumi, Ibrahim Adeyanju	Performance Evaluation of Modified Best First Decreasing Algorithms for Dynamic Virtual Machine Placement in Cloud Computing.	CLOUD	2022	DBLP DOI BibTeX RDF
14	Yifan He, Abdallah Saffidine	QBF Solving Using Best First Search.	CG	2022	DBLP DOI BibTeX RDF
14	Patrick Rodler	Random vs. Best-First: Impact of Sampling Strategies on Decision Making in Model-Based Diagnosis.	AAAI	2022	DBLP DOI BibTeX RDF
14	Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, Simon de Givry	Parallel Hybrid Best-First Search.	CP	2022	DBLP DOI BibTeX RDF
14	Shinsaku Sakaue, Taihei Oki	Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search.	NeurIPS	2022	DBLP BibTeX RDF
14	Dieqiao Feng, Carla P. Gomes, Bart Selman	Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning.	NeurIPS	2022	DBLP BibTeX RDF
14	Augusto B. Corrêa, Jendrik Seipp	Best-First Width Search for Lifted Classical Planning.	ICAPS	2022	DBLP BibTeX RDF
14	Chao Gao, Jingwei Chen, Tong Mo, Tanvir Sajed, Shangling Jui, Min Qin, Laiyuan Gong, Wei Lu 0023	A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs.	SOCS	2022	DBLP DOI BibTeX RDF
14	Patrick Ferber, Liat Cohen, Jendrik Seipp, Thomas Keller 0001	Learning and Exploiting Progress States in Greedy Best-First Search.	IJCAI	2022	DBLP DOI BibTeX RDF
14	Quentin Cohen-Solal	Completeness of Unbounded Best-First Game Algorithms.	CoRR	2021	DBLP BibTeX RDF
14	Malak Hamad Al-Mashagbeh, Mohammad Ababneh	Tor Detection using a Machine Learning Approach Using Correlation based Feature Selection with Best First and Random Forest.	ICIT	2021	DBLP DOI BibTeX RDF
14	Jingwei Chen, Nathan R. Sturtevant	Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions.	AAAI	2021	DBLP DOI BibTeX RDF
14	Alexander Sakharov	A Best-first Backward-chaining Search Strategy based on Learned Predicate Representations.	ICAART (2)	2021	DBLP DOI BibTeX RDF
14	Jingwei Chen, Nathan R. Sturtevant	Avoiding Re-expansions in Suboptimal Best-First Search.	SOCS	2021	DBLP DOI BibTeX RDF
14	Patrick Rodler	Linear-Space Best-First Diagnosis Search.	SOCS	2021	DBLP DOI BibTeX RDF
14	Huosong Xia, Xiaoting Pan, Yanjun Zhou, Zuopeng Justin Zhang	Creating the best first impression: Designing online product photos to increase sales.	Decis. Support Syst.	2020	DBLP DOI BibTeX RDF
14	Marvin Chandra Wijaya	Two Stages Best First Search Algorithm Using Hard and Soft Constraints Heuristic for Course Timetabling.	Rev. d'Intelligence Artif.	2020	DBLP DOI BibTeX RDF
14	Eric Timmons, Brian Charles Williams	Best-First Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation.	J. Artif. Intell. Res.	2020	DBLP DOI BibTeX RDF
14	Clara Meister, Ryan Cotterell, Tim Vieira	Best-First Beam Search.	Trans. Assoc. Comput. Linguistics	2020	DBLP DOI BibTeX RDF
14	Clara Meister, Tim Vieira, Ryan Cotterell	Best-First Beam Search.	CoRR	2020	DBLP BibTeX RDF
14	Patrick Rodler	Sound, Complete, Linear-Space, Best-First Diagnosis Search.	CoRR	2020	DBLP BibTeX RDF
14	Dongge Liu, Gidon Ernst, Toby Murray, Benjamin I. P. Rubinstein	Legion: Best-First Concolic Testing.	CoRR	2020	DBLP BibTeX RDF
14	Ivan Serina, Mauro Vallati	Configurable Heuristic Adaptation for Improving Best First Search in AI Planning.	ICTAI	2020	DBLP DOI BibTeX RDF
14	Dongge Liu, Gidon Ernst, Toby Murray, Benjamin I. P. Rubinstein	LEGION: Best-First Concolic Testing.	ASE	2020	DBLP DOI BibTeX RDF
14	Ryo Kuroiwa 0002, Alex Fukunaga	Analyzing and Avoiding Pathological Behavior in Parallel Best-First Search.	ICAPS	2020	DBLP BibTeX RDF
14	Maximilian Fickert	A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search.	ICAPS	2020	DBLP BibTeX RDF
14	Eric Timmons, Brian C. Williams	Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation (Extended Abstract). (Journal track)	IJCAI	2020	DBLP DOI BibTeX RDF
14	Dongge Liu, Gidon Ernst, Toby Murray, Benjamin I. P. Rubinstein	Legion: Best-First Concolic Testing (Competition Contribution).	FASE	2020	DBLP DOI BibTeX RDF
14	Yaojun Wang, Dongbo Bu, Chuncui Huang, Hui Wang, Jinyu Zhou, Junchuan Dong, Weiyi Pan, Jingwei Zhang, Qi Zhang, Yan Li, Shiwei Sun	Best-first search guided multistage mass spectrometry-based glycan identification.	Bioinform.	2019	DBLP DOI BibTeX RDF
14	Ishan Srivastava	A different take on the best-first game tree pruning algorithms.	CoRR	2019	DBLP BibTeX RDF
14	Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina	Best-First Width Search for Multi Agent Privacy-preserving Planning.	CoRR	2019	DBLP BibTeX RDF
14	Shinsaku Sakaue, Naoki Marumo	Best-first Search Algorithm for Non-convex Sparse Minimization.	CoRR	2019	DBLP BibTeX RDF
14	Hygor Xavier Araújo, Raul Fonseca Neto, Saulo Moraes Villela	A best-first branch-and-bound search for solving the transductive inference problem using support vector machines.	ESANN	2019	DBLP BibTeX RDF
14	Radu Marinescu 0002, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler	Anytime Recursive Best-First Search for Bounding Marginal MAP.	AAAI	2019	DBLP DOI BibTeX RDF
14	Cristian Frasinaru, Madalina Raschip	Greedy Best-First Search for the Optimal-Size Sorting Network Problem.	KES	2019	DBLP DOI BibTeX RDF
14	Ryo Kuroiwa 0002, Alex Fukunaga	On the Pathological Search Behavior of Distributed Greedy Best-First Search.	ICAPS	2019	DBLP BibTeX RDF
14	Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina	Best-First Width Search for Multi Agent Privacy-Preserving Planning.	ICAPS	2019	DBLP BibTeX RDF
14	Md Akizur Rahman, Priyanka Singh, Ravie Chandren Muniyandi, Domingo Mery, Mukesh Prasad	Prostate Cancer Classification Based on Best First Search and Taguchi Feature Selection Method.	PSIVT	2019	DBLP DOI BibTeX RDF
14	Leopold E. Mayer, Kurt D. Krebsbach	Front-to-Front Bidirectional Best-First Search Reconsidered.	FLAIRS	2019	DBLP BibTeX RDF
14	William Lam, Kalev Kask, Javier Larrosa, Rina Dechter	Subproblem ordering heuristics for AND/OR best-first search.	J. Comput. Syst. Sci.	2018	DBLP DOI BibTeX RDF
14	Ghassan Samara, Mohammad Aljaidi	Aware-routing protocol using best first search algorithm in wireless sensor.	Int. Arab J. Inf. Technol.	2018	DBLP BibTeX RDF
14	Liang Liu 0013, Long Gong, Sen Yang 0001, Jun (Jim) Xu, Lance Fortnow	Best First Fit (BFF): An Approach to Partially Reconfigurable Hybrid Circuit and Packet Switching.	IEEE CLOUD	2018	DBLP DOI BibTeX RDF
14	Shinsaku Sakaue, Masakazu Ishihata	Accelerated Best-First Search With Upper-Bound Computation for Submodular Function Maximization.	AAAI	2018	DBLP DOI BibTeX RDF
14	Qi Lou, Rina Dechter, Alexander Ihler	Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP.	AAAI	2018	DBLP DOI BibTeX RDF
14	Masaaki Nishino, Takeru Inoue, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata	Optimizing Network Reliability via Best-First Search over Decision Diagrams.	INFOCOM	2018	DBLP DOI BibTeX RDF
14	Manuel Heusner, Thomas Keller 0001, Malte Helmert	Search Progress and Potentially Expanded States in Greedy Best-First Search.	IJCAI	2018	DBLP DOI BibTeX RDF
14	Masataro Asai, Alex Fukunaga	Tie-Breaking Strategies for Cost-Optimal Best First Search.	J. Artif. Intell. Res.	2017	DBLP DOI BibTeX RDF
14	Yuu Jinnai, Alex Fukunaga	On Hash-Based Work Distribution Methods for Parallel Best-First Search.	J. Artif. Intell. Res.	2017	DBLP DOI BibTeX RDF
14	Yuu Jinnai, Alex Fukunaga	On Hash-Based Work Distribution Methods for Parallel Best-First Search.	CoRR	2017	DBLP BibTeX RDF