Sciweavers

94 search results - page 8 / 19
» Competitive Memetic Algorithms for Arc Routing Problems
Sort
View
SPAA
2003
ACM
14 years 18 days ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
DAC
2012
ACM
11 years 9 months ago
ComPLx: A Competitive Primal-dual Lagrange Optimization for Global Placement
We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the origin...
Myung-Chul Kim, Igor L. Markov
ICGA
1997
103views Optimization» more  ICGA 1997»
13 years 8 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
INFOCOM
2005
IEEE
14 years 29 days ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
ICTAI
2003
IEEE
14 years 20 days ago
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique dec...
Kenny Qili Zhu