Sciweavers

4524 search results - page 165 / 905
» The Complexity of Global Constraints
Sort
View
AAMAS
2008
Springer
15 years 6 months ago
Anticipation based on constraint processing in a multi-agent context
Anticipation is a general concept used and applied in various domains. Many studies in the field of artificial intelligence have investigated the capacity for anticipation. In thi...
Arnaud Doniec, René Mandiau, Sylvain Piecho...
ENTCS
2007
190views more  ENTCS 2007»
15 years 6 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
COMPULOG
1999
Springer
15 years 10 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
MOR
2008
83views more  MOR 2008»
15 years 6 months ago
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
Bernhard von Stengel, Françoise Forges
ECML
2005
Springer
16 years 2 days 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é...