Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Combinatorial search

In computer science and artificial intelligence, combinatorial search studies search algorithms for solving instances of problems that are believed… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
In this paper we show that a large class of diverse problems have a bicomposite structure which makes it possible to solve them… Expand
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate… Expand
  • figure 1
  • figure 4
  • table 1
  • table 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2002
Highly Cited
2002
DNA micro-arrays now permit scientists to screen thousands of genes simultaneously and determine whether those genes are active… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A large body of work argues that scientific research increases the rate of technological advance, and with it economic growth… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Abstract We apply the two-player game assumptions of limited search horizon and commitment to moves in constant time, to single… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1988
Highly Cited
1988
What should you think more? Time to get this [PDF? It is easy then. You can only sit and stay in your place to get this book. Why… Expand
Is this relevant?