2343 search results - page 338 / 469 » The Locomotive Routing Problem |
157
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...
141
Voted
HIPC
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we describe a novel strategy for carrying out lookups in Chord-based peer-to-peer (P2P) networks, wherein nodes are assumed to behave selfishly. This is in contrast ...
140
Voted
MWCN
2004
Springer
15 years 10 months ago
2004
Springer
In Mobile Ad Hoc Networks (MANETs), each node has the capacity to act as a router. The performance of the MANET relies on how well the nodes perform this function. In simulations,...
131
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
132
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— In [1], [2] it was noticed that sometimes it takes BGP a substantial amount of time and messages to converge and stabilize following the failure of some node in the Internet. I...