Sciweavers

40 search results - page 6 / 8
» Differential approximation results for the traveling salesma...
Sort
View
ANOR
2004
68views more  ANOR 2004»
13 years 7 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 8 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
METMBS
2003
128views Mathematics» more  METMBS 2003»
13 years 9 months ago
Genetic Code as a Gray Code Revisited
In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid co...
Dragan Bosnacki, Huub M. M. ten Eikelder, Peter A....
FOCS
2006
IEEE
14 years 1 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 7 months ago
Fitness Uniform Optimization
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
Marcus Hutter, Shane Legg