3047 search results - page 388 / 610 » On the Meaning of Logical Completeness |
145
click to vote
TMC
2012
13 years 1 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
WWW
2009
ACM
15 years 11 months ago
2009
ACM
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
100
click to vote
INFOCOM
2009
IEEE
15 years 5 months ago
2009
IEEE
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
130
click to vote
FUN
2010
Springer
15 years 2 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...