Sciweavers

267 search results - page 54 / 54
» Obtaining The Correspondence between Bayesian and Neural Net...
Sort
View
PODC
2006
ACM
13 years 11 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ATAL
2010
Springer
13 years 6 months ago
Exploiting scale invariant dynamics for efficient information propagation in large teams
Large heterogeneous teams will often be in situations where sensor data that is uncertain and conflicting is shared across a peer-to-peer network. Not every team member will have ...
Robin Glinton, Paul Scerri, Katia P. Sycara