Sciweavers

2343 search results - page 373 / 469
» The Locomotive Routing Problem
Sort
View
JCO
2006
101views more  JCO 2006»
15 years 4 months ago
Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks
Abstract Energy conservation in mobile ad hoc networks is of paramount importance because most mobile nodes usually have very limited energy supply. Previous research on this issue...
Wei Liu, Yanchao Zhang, Yuguang Fang, Kejie Lu
JGAA
2006
127views more  JGAA 2006»
15 years 4 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
ENVSOFT
2007
258views more  ENVSOFT 2007»
15 years 4 months ago
Optimal groundwater monitoring design using an ant colony optimization paradigm
Groundwater long-term monitoring (LTM) is required to assess the performance of groundwater remediation and human being health risk at post-closure sites where groundwater contami...
Yuanhai Li, Amy B. Chan Hilton
GRID
2007
Springer
15 years 4 months ago
A Local Facility Location Algorithm for Large-scale Distributed Systems
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
Denis Krivitski, Assaf Schuster, Ran Wolff
160
Voted
TON
2008
125views more  TON 2008»
15 years 4 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni