Sciweavers

4451 search results - page 237 / 891
» On Random Ordering Constraints
Sort
View
ECAI
2004
Springer
15 years 12 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í...
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
15 years 12 months ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...
B
1998
Springer
15 years 10 months ago
Introducing Dynamic Constraints in B
In B, the expression of dynamic constraints is notoriously missing. In this paper, we make various proposals for introducing them. They all express, in di erent complementary ways,...
Jean-Raymond Abrial, Louis Mussat
ECAI
2006
Springer
15 years 10 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
AUSAI
2008
Springer
15 years 8 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan