886 search results - page 109 / 178 » Reasoning with contextual graphs |
132
click to vote
TASE
2009
IEEE
15 years 10 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
119
click to vote
ICTAI
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
138
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
Many medical applications require a registration of different images of the same organ. In many cases, such a registration is accomplished by manually placing landmarks in the ima...
116
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
148
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...