4131 search results - page 232 / 827 » Compactness in Topology and Computation |
155
click to vote
ISCC
2005
IEEE
16 years 4 days ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
172
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
187
click to vote
JVM
2004
15 years 8 months ago
2004
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
195
click to vote
SENSYS
2003
ACM
15 years 11 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
169
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...