4865 search results - page 554 / 973 » The Complexity of Graph Connectivity |
178
click to vote
SC
2004
ACM
16 years 9 days ago
2004
ACM
This work describes a technique for improving network performance in Grid environments that we refer to as “logistics.” We demonstrate that by using storage and cooperative fo...
182
click to vote
SENSYS
2004
ACM
16 years 9 days ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
178
click to vote
ICCSA
2004
Springer
16 years 7 days ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
163
click to vote
PPSN
2004
Springer
16 years 7 days ago
2004
Springer
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
173
click to vote
IPPS
2003
IEEE
16 years 4 days ago
2003
IEEE
Kahn defined a formal model for networks of processes that communicate through channels carrying streams of data tokens. His mathematical results show the necessary conditions fo...