Sciweavers

12825 search results - page 2250 / 2565
» Improved PLSOM algorithm
Sort
View
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
15 years 6 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 6 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 6 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ASPDAC
2008
ACM
124views Hardware» more  ASPDAC 2008»
15 years 6 months ago
MaizeRouter: Engineering an effective global router
In this paper, we present the complete design and architectural details of MAIZEROUTER. MAIZEROUTER reflects a significant leap in progress over existing publicly available routing...
Michael D. Moffitt
ICALP
2010
Springer
15 years 6 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
« Prev « First page 2250 / 2565 Last » Next »