1073 search results - page 199 / 215 » ParaDisEO-Based Design of Parallel and Distributed Evolution... |
135
click to vote
SPAA
2006
ACM
15 years 8 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...
211
Voted
SPAA
2005
ACM
15 years 8 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...
140
Voted
SPAA
2004
ACM
15 years 8 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...
137
Voted
CLOUD
2010
ACM
15 years 7 months 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...
105
Voted
IPPS
2008
IEEE
15 years 9 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...