Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AI
2011
Springer
11 years 17 days ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
AAAI
1994
11 years 6 months ago
On the Inherent Level of Local Consistency in Constraint Networks
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
Peter van Beek
IJCAI
2007
11 years 7 months ago
Learning Implied Global Constraints
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest i...
Christian Bessière, Remi Coletta, Thierry P...
IJCAI
2007
11 years 7 months ago
Combining Topological and Directional Information for Spatial Reasoning
Current research on qualitative spatial representation and reasoning usually focuses on one single aspect of space. However, in real world applications, several aspects are often ...
Sanjiang Li
CP
2008
Springer
11 years 7 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
BIRTHDAY
2008
Springer
11 years 7 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
CSCLP
2006
Springer
11 years 9 months ago
Extracting Microstructure in Binary Constraint Networks
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
Chavalit Likitvivatanavong, Roland H. C. Yap
CP
2006
Springer
11 years 9 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
books