2473 search results - page 319 / 495 » The Logic of Communication Graphs |
198
click to vote
ICDCSW
2009
IEEE
16 years 1 months ago
2009
IEEE
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
180
click to vote
IEEEPACT
2009
IEEE
16 years 1 months ago
2009
IEEE
Industry is moving towards multi-core designs as we have hit the memory and power walls. Multi-core designs are very effective to exploit thread-level parallelism (TLP) but do not...
179
click to vote
GLOBECOM
2007
IEEE
16 years 27 days ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
167
click to vote
ICDCSW
2007
IEEE
16 years 27 days ago
2007
IEEE
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...
155
click to vote
KES
2007
Springer
16 years 21 days ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...