400 search results - page 69 / 80 » Backtracking |
CONSTRAINTS
1998
13 years 8 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
IJFCS
1998
13 years 8 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
CL
1999
Springer
13 years 8 months ago
1999
Springer
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
JAIR
1998
13 years 8 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
SIAMCOMP
2002
13 years 8 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...