We address in this paper the question of how the knowledge of the marginal distribution P(x) can be incorporated in a learning algorithm. We suggest three theoretical methods for ...
Multi-agent systems are a kind of concurrent distributed systems. In this work, some guidelines on how to create multi-agent systems using Erlang are presented. The modelled syste...
Carlos Varela, Carlos Abalde, Laura M. Castro, Jos...
The development of applications and tools for highperformance "computational grids" is complicated by the heterogeneity and frequently dynamic behavior of the underlying...
Sharon Brunett, Karl Czajkowski, Steven Fitzgerald...
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursi...
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...