Sciweavers

805 search results - page 74 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
SARA
2000
Springer
15 years 1 months ago
Recent Progress in the Design and Analysis of Admissible Heuristic Functions
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, wi...
Richard E. Korf
CPAIOR
2007
Springer
15 years 4 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
87
Voted
DCOSS
2006
Springer
15 years 1 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
ECCV
2002
Springer
15 years 12 months ago
Maximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
João Costeira, João Maciel
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 4 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...