Sciweavers

2343 search results - page 432 / 469
» The Locomotive Routing Problem
Sort
View
SPAA
2006
ACM
14 years 3 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
SPAA
2006
ACM
14 years 3 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
BROADNETS
2005
IEEE
14 years 3 months ago
Dual-link failure resiliency through backup link mutual exclusion
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Amit Chandak, Srinivasan Ramasubramanian
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
14 years 3 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
INFOCOM
2003
IEEE
14 years 3 months ago
Large-scale Data Collection: a Coordinated Approach
— In this paper we consider the problem of collecting a large amount of data from several different hosts to a single destination in a wide-area network. Often, due to congestion...
William C. Cheng, Cheng-Fu Chou, Leana Golubchik, ...