Sciweavers

3433 search results - page 308 / 687
» Heuristics for a bidding problem
Sort
View
GLOBECOM
2006
IEEE
16 years 25 days ago
Survivable Wireless Access Network Design with Dual-homing Capabilities
— With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of quality of service is becoming an important component of ...
Mohammad Masud Hasan, Xiaodong Huang, Jason P. Jue
COMPGEOM
2006
ACM
16 years 23 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
CPAIOR
2005
Springer
16 years 9 days ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
GECCO
2005
Springer
145views Optimization» more  GECCO 2005»
16 years 9 days ago
Three dimensional evolutionary aerodynamic design optimization with CMA-ES
In this paper, we present the application of evolutionary optimization methods to a demanding, industrially relevant engineering domain, the three-dimensional optimization of gas ...
Martina Hasenjäger, Bernhard Sendhoff, Toyota...
EVOW
2004
Springer
16 years 5 days ago
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
Thomas Stützle, Susana Fernandes