Sciweavers

1225 search results - page 190 / 245
» The Instance Complexity Conjecture
Sort
View
ECCV
2010
Springer
13 years 10 months ago
Piecewise Quadratic Reconstruction of Non-Rigid Surfaces from Monocular Sequences
Abstract. In this paper we present a new method for the 3D reconstruction of highly deforming surfaces (for instance a flag waving in the wind) viewed by a single orthographic came...
João Fayad, Lourdes de Agapito, Alessio Del...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 10 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 10 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
GLOBECOM
2008
IEEE
13 years 9 months ago
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
GLVLSI
2008
IEEE
150views VLSI» more  GLVLSI 2008»
13 years 9 months ago
Using unsatisfiable cores to debug multiple design errors
Due to the increasing complexity of today's circuits a high degree of automation in the design process is mandatory. The detection of faults and design errors is supported qu...
André Sülflow, Görschwin Fey, Rod...