17760 search results - page 224 / 3552 » A Generalization of the Massey-Ding Algorithm |
193
click to vote
KR
1994
Springer
15 years 8 months ago
1994
Springer
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
106
click to vote
IJCAI
2003
15 years 5 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
123
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
148
click to vote
ENTCS
2006
15 years 4 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
194
click to vote
TSE
2011
14 years 11 months ago
2011
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...