1073 search results - page 199 / 215 » ParaDisEO-Based Design of Parallel and Distributed Evolution... |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CLOUD
2010
ACM
14 years 22 days ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
— To share and exchange the files among Internet users, Peerto-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P fil...