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

State space search

State space search is a process used in the field of computer science, including artificial intelligence (AI), in which successive configurations or… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major… Expand
Is this relevant?
2005
2005
Obtaining an optimal schedule for a set of precedence-constrained tasks is a well-known NP-complete problem in its general form… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Most recent strides in scaling up planning have centered around two competing themesdisjunctive planners, exemplified by… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
1999
1999
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
1998
1998
  • Johan Lilius
  • Electron. Notes Theor. Comput. Sci.
  • 1998
  • Corpus ID: 14724126
Partial-order reduction methods provide a number of well studied methods that have been succesfully applied to the state-space… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset… Expand
  • figure I
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Unfoldings of Petri nets provide a method of searching the state space of concurrent systems without considering all possible… Expand
Is this relevant?
1994
1994
Abstract We present two time-efficient state space algorithms for searching minimax trees. Because they are based on SSS∗ and… Expand
  • figure 3
  • figure 5
  • table I
  • figure 6
Is this relevant?
1988
1988
When N processors perform depth-first search on disjoint parts of a state space tree to find a solution, the speedup can be… Expand
  • figure 1
  • figure 2
Is this relevant?
1986
1986
PS*, a new sequential tree searching algorithm based on the State Space Search (SSS*), is presented. PS*(k) divides each MAX node… Expand
  • figure 1
  • figure 2
  • table 2
  • table 4
  • table 6
Is this relevant?