413 search results - page 71 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
85
Voted
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
113
click to vote
ICDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...