Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Today there is a significant body of results of resource management in real-time systems. However, most of them are based on "open-loop" strategies and techniques that do...
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...