Combinatorial search

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

Topic mentions per year

Topic mentions per year

1967-2017
0204019672017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate… (More)
  • figure 1
  • figure 4
  • table 1
  • table 3
  • table 2
Is this relevant?
2006
2006
We show how combinatorial search strategies including depth-first, breadth-first and depth-bounded search can be viewed as… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A large body of work argues that scientific research increases the rate of technological advance, and with it economic growth… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2001
2001
Recently, it has been found that the cost distributions of randomized backtrack search in combinatorial domains are often… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Our objective in writing this book was to produce a general, introductory textbook on the subject o f combinatorial algorithms… (More)
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… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search… (More)
  • figure 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1996
1996
Combinatorial search problems are ubiquitous in many areas of computer science. They are generally stated in terms of constraints… (More)
Is this relevant?
1981
1981
Many combinatorial search problems consist of finding values for a set of variables ( x 1, x2, . . . , x, ), where each variable… (More)
Is this relevant?