Sciweavers

714 search results - page 135 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
AAAI
2010
13 years 11 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
FLAIRS
2004
13 years 11 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
IJCAI
2003
13 years 11 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 9 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
SPATIALCOGNITION
2004
Springer
14 years 3 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl