1615 search results - page 86 / 323 » Distributed Forward Checking |
ENTCS
2002
13 years 7 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
JAIR
2000
13 years 7 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
HIS
2009
13 years 5 months ago
2009
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
COMCOM
2004
13 years 7 months ago
2004
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
COMPULOG
1999
Springer
14 years 3 days ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...