Sciweavers

717 search results - page 71 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
141 views 137 votes 15 years 8 months ago  ICDT 2010»
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
95 views 138 votes 15 years 11 months ago  EVOW 2009»
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
104 views 143 votes 15 years 8 months ago  EXPCS 2007»
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
125 views 133 votes 15 years 6 months ago  CP 2008»
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
104 views 138 votes 15 years 6 months ago  CISSE 2008»
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
93 views 122 votes 15 years 10 months ago  MICAI 2004»
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
92 views 158 votes 15 years 8 months ago  CP 1999»
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
120 views 136 votes 15 years 10 months ago  CP 2007»
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
100 views 147 votes 15 years 5 months ago  AAAI 1994»
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
136 views 224 votes 16 years 5 months ago  CP 2009»
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...