3 We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensi...
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
This paper proposes a method for the stabilization of vehicle formations in the plane under a fixed, but not necessarily complete, sensing graph. In this method each agent acts to ...