Sciweavers

944 search results - page 89 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 4 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
COR
2007
103views more  COR 2007»
14 years 10 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 4 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
INFOCOM
2003
IEEE
15 years 3 months ago
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
Frédéric Giroire, Antonio Nucci, Nin...
83
Voted
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 4 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka