Sciweavers

942 search results - page 150 / 189
» Distance Constraint Satisfaction Problems
Sort
View
140
Voted
ATAL
2005
Springer
15 years 8 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
CP
2010
Springer
15 years 1 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 3 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
AAAI
1997
15 years 4 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
15 years 4 months ago
Swarm intelligence in e-learning: a learning object sequencing agent based on competencies
In e-learning initiatives content creators are usually required to arrange a set of learning resources in order to present them in a comprehensive way to the learner. Course mater...
Luis de Marcos, José-Javier Martínez...