In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
James A. Cowling, Daniel S. Myers, Barbara Liskov,...
"A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically...
— This paper presents a new Path Planning method which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voronoi diagram. ...