Sciweavers

9119 search results - page 318 / 1824
» A Simultaneous Search Problem
Sort
View
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
16 years 23 days 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
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 4 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
CDB
2004
Springer
172views Database» more  CDB 2004»
16 years 2 days ago
Constraint Database Solutions to the Genome Map Assembly Problem
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...
Viswanathan Ramanathan, Peter Z. Revesz
ECAI
2004
Springer
16 years 2 days ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
16 years 2 days ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke