Sciweavers

138 search results - page 14 / 28
» Domain Transmutation in Constraint Satisfaction Problems
Sort
View
IAAI
2001
13 years 9 months ago
Constraint-Based Modeling of InterOperability Problems Using an Object-Oriented Approach
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices...
Mohammed H. Sqalli, Eugene C. Freuder
ATAL
2010
Springer
13 years 8 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
IFIP12
2009
13 years 5 months ago
Defining a Task's Temporal Domain for Intelligent Calendar Applications
Abstract Intelligent calendar assistants have many years ago attracted researchers from the areas of scheduling, machine learning and human computer interaction. However, all effor...
Anastasios Alexiadis, Ioannis Refanidis
AAAI
2006
13 years 9 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
CP
2003
Springer
14 years 27 days ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...