Sciweavers

717 search results - page 47 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
112 views 120 votes 15 years 3 months ago  AAAI 2008»
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
119 views 120 votes 15 years 7 months ago  CSCLP 2004»
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
115 views 95 votes 16 years 1 months ago  RECOMB 2004»
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
137 views 105 votes 15 years 5 months ago  ECAI 2006»
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
100 views 115 votes 15 years 2 months ago  AAAI 1994»
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
90 views 107 votes 15 years 7 months ago  CP 2005»
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
98 views 124 votes 15 years 5 months ago  CP 1999»
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
82 views 72 votes 15 years 7 months ago  ECAL 2005»
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
147 views 107 votes 15 years 1 months ago  CORR 2007»
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
137 views 126 votes 15 years 1 months ago  DAM 2000»
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...