Sciweavers

153 search results - page 5 / 31
» An experimental study of greedy routing algorithms
Sort
View
JUCS
2008
153views more  JUCS 2008»
14 years 11 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
SENSYS
2003
ACM
15 years 4 months ago
On the effect of localization errors on geographic face routing in sensor networks
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
Karim Seada, Ahmed Helmy, Ramesh Govindan
SAC
2009
ACM
15 years 6 months ago
An empirical study of incorporating cost into test suite reduction and prioritization
Software developers use testing to gain and maintain confidence in the correctness of a software system. Automated reduction and prioritization techniques attempt to decrease the...
Adam M. Smith, Gregory M. Kapfhammer
CEC
2010
IEEE
14 years 11 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
COR
2008
111views more  COR 2008»
14 years 11 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song