Sciweavers

69 search results - page 5 / 14
» On the selectivity of multidimensional routing indices
Sort
View
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
13 years 8 months ago
Maintaining diversity through adaptive selection, crossover and mutation
This paper presents an Adaptive Genetic Algorithm (AGA) where selection pressure, crossover and mutation probabilities are adapted according to population diversity statistics. Th...
Brian McGinley, Fearghal Morgan, Colm O'Riordan
INFOCOM
2008
IEEE
14 years 1 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
CP
1998
Springer
13 years 11 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
TON
2012
11 years 10 months ago
A Joint Approach to Routing Metrics and Rate Adaptation in Wireless Mesh Networks
—This work proposes MARA, a joint method for automatic rate selection and route quality evaluation in Wireless Mesh Networks. This method targets at avoiding the problem of inacc...
Diego G. Passos, Célio V. N. Albuquerque
SIGOPSE
2004
ACM
14 years 29 days ago
The firecracker protocol
We propose the Firecracker protocol for data dissemination in wireless sensor networks. Firecracker uses a combination of routing and broadcasts to rapidly deliver a piece of data...
Philip Levis, David E. Culler