1051 search results - page 199 / 211 » Foundations of Constraint Satisfaction |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
JACIII
2007
14 years 9 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
71
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Clusters of computers have emerged as mainstream parallel and distributed platforms for high-performance, highthroughput and high-availability computing. To enable effective resou...
PUC
2007
14 years 9 months ago
2007
Personal experience computing is an emerging research area in computing support for capturing, archiving, editing, and utilizing of digital personal experiences. This paper presen...
104
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
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...