3446 search results - page 227 / 690 » A Reasoning Algorithm for pD* |
160
click to vote
ILP
2003
Springer
15 years 10 months ago
2003
Springer
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
149
click to vote
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
160
click to vote
WABI
2001
Springer
15 years 9 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
128
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
143
click to vote
CONCUR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...