202 search results - page 8 / 41 » Complexity of Collective Communications on NoCs |
180
click to vote
GLOBECOM
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
169
click to vote
ECAL
1999
Springer
15 years 10 months ago
1999
Springer
We report on a case study in the emergence of a lexicon in a group of autonomous distributed agents situated and grounded in an open environment. Because the agents are autonomous,...
146
click to vote
ICSE
2008
IEEE-ACM
16 years 6 months ago
2008
IEEE-ACM
Because the knowledge required for the construction of a complex software system is often widely distributed among its members, programmers routinely engage in collaboration with ...
140
click to vote
INFOCOM
2007
IEEE
16 years 7 days ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
140
click to vote
ICIDS
2009
Springer
16 years 15 days ago
2009
Springer
Using lifelogging tools, personal digital artifacts are collected continuously and passively throughout each day. The wealth of information such an archive contains on our life his...