Sciweavers

28 search results - page 2 / 6
» Constraint satisfaction algorithms for graphical games
Sort
View
ECAI
2004
Springer
13 years 10 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 4 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
ISCAPDCS
2004
13 years 6 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
AI
2008
Springer
13 years 4 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 5 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...