Sciweavers

400 search results - page 22 / 80
» Backtracking
Sort
View
SAT
2005
Springer
138views Hardware» more  SAT 2005»
14 years 3 months ago
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
Vasco M. Manquinho, João P. Marques Silva
ECAI
2004
Springer
14 years 3 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
LPNMR
2004
Springer
14 years 3 months ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf
APN
2003
Springer
14 years 3 months ago
Deciding Life-Cycle Inheritance on Petri Nets
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynam...
H. M. W. (Eric) Verbeek, Twan Basten
CP
2003
Springer
14 years 3 months ago
Distributed Forward Checking
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
Ismel Brito, Pedro Meseguer