Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Search problem
OpenAlex ID:
C201789804
The Fast Downward Planning System
2006
·
M. Helmert
·
Journal of Artificial Intelligence Research
·
2,022
PDF
Learning to Order Things
1999
·
W. W. Cohen
, R. E. Schapire
, et al.
·
Journal of Artificial Intelligence Research
·
910
PDF
Boosting combinatorial search through randomization
1998
·
Carla P. Gomes
, Bart Selman
, et al.
·
National Conference on Artificial Intelligence
·
701
Optimal Network Topologies for Local Search with Congestion
2002
·
R. Guimerà
, A. Díaz-Guilera
, et al.
·
Physical Review Letters
·
634
PDF
Information search tactics
1979
·
Marcia J. Bates
·
Journal of the American Society for Information Science
·
546
Embedding-based Retrieval in Facebook Search
2020
·
Jui-Ting Huang
, Ashish Sharma
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
543
PDF
Searching for solutions in games and artificial intelligence
1994
·
L.V. Allis
·
Research Publications (Maastricht University)
·
460
PDF
Filtered beam search in scheduling†
1988
·
PENG SI OW
, THOMAS E. MORTON
·
International Journal of Production Research
·
458
The increasing cost tree search for optimal multi-agent pathfinding
2012
·
Guni Sharon
, Roni Stern
, et al.
·
Artificial Intelligence
·
423
PDF
Simple random search provides a competitive approach to reinforcement learning
2018
·
Mania, Horia
, Guy, Aurelia
, et al.
·
arXiv (Cornell University)
·
350
PDF
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
2021
·
Jiaoyang Li
, Wheeler Ruml
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
348
Direct Search Methods on Parallel Machines
1991
·
J. E. Dennis, Jr.
, Virginia Torczon
·
SIAM Journal on Optimization
·
341
Filtering Search: A New Approach to Query-Answering
1986
·
Bernard Chazelle
·
SIAM Journal on Computing
·
331
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
2004
·
Stefan Droste
, Thomas Jansen
, et al.
·
Theory of Computing Systems
·
312
PDF
Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search
2020
·
Jonathan D Gammell
, Timothy D Barfoot
, et al.
·
The International Journal of Robotics Research
·
293
PDF
ZeroSearch: Incentivize the Search Capability of LLMs without Searching
2025
·
Sun, Hao
, Qiao, Zile
, et al.
·
arXiv (Cornell University)
·
266
PDF
The Relative Complexity of NP Search Problems
1998
·
Paul Beame
, Stephen Cook
, et al.
·
Journal of Computer and System Sciences
·
218
Contingent Planning via Heuristic Forward Search with Implicit Belief States
2005
·
Jörg Hoffmann
, Ronen I. Brafman
, et al.
·
Max Planck Institute for Plasma Physics
·
216
Proof-number search
1994
·
L.Victor Allis
, Maarten van der Meulen
, et al.
·
Artificial Intelligence
·
213
Coping with errors in binary search procedures
1980
·
R.L. Rivest
, A.R. Meyer
, et al.
·
Journal of Computer and System Sciences
·
200
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
2013
·
Ryan Williams
·
SIAM Journal on Computing
·
198
A stochastic beam search for the berth allocation problem
2006
·
Fan Wang
, Andrew Lim
·
Decision Support Systems
·
194
Optimal Search for a Moving Target in Discrete Time and Space
1980
·
Scott Shorey Brown
·
Operations Research
·
193
Hierarchical Structure and Search in Complex Organizations
2010
·
Jürgen Mihm
, Christoph H. Loch
, et al.
·
Management Science
·
185
Hierarchical A *: searching abstraction hierarchies efficiently
1996
·
Robert C. Holte
, M. B. Perez
, et al.
·
National Conference on Artificial Intelligence
·
184
Show more works
View as search
Works count:
3,069
Citation count:
32,350
Year
Topic
Type