Sciweavers

68 search results - page 5 / 14
» The Effect of Nogood Learning in Distributed Constraint Sati...
Sort
View
AGENTS
2001
Springer
15 years 2 months ago
Argumentation as distributed constraint satisfaction: applications and results
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
Hyuckchul Jung, Milind Tambe, Shriniwas Kulkarni
JMLR
2012
13 years 14 hour ago
Deterministic Annealing for Semi-Supervised Structured Output Learning
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
Paramveer S. Dhillon, S. Sathiya Keerthi, Kedar Be...
JAR
2000
129views more  JAR 2000»
14 years 9 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...
CP
2010
Springer
14 years 8 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
ECML
2005
Springer
15 years 3 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...