Sciweavers

717 search results - page 62 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
124 views 196 votes 16 years 2 months ago  GIS 2007»
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
185 views 139 votes 14 years 12 months ago  SODA 2010»
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
130 views 93 votes 15 years 2 months ago  AAAI 1997»
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
95 views 87 votes 15 years 7 months ago  CSCLP 2007»
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
68 views 99 votes 15 years 3 months ago  CP 2008»
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
127 views 82 votes 15 years 2 months ago  IJCAI 1993»
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
97 views 100 votes 15 years 1 months ago  JAL 2008»
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
100 views 84 votes 15 years 2 months ago  IJCAI 1993»
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
143 views 109 votes 15 years 6 months ago  ATAL 2003»
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
93 views 104 votes 15 years 1 months ago  JETAI 2008»
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...