Sciweavers

2613 search results - page 341 / 523
» On an Optimization Problem in Sensor Selection*
Sort
View
65
Voted
ATAL
2006
Springer
15 years 1 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
14 years 5 months ago
Sensor-based robot deployment algorithms
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...
Jerome Le Ny, George J. Pappas
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 3 months ago
Hierarchical multi-sensor image registration using evolutionary computation
Image registration between multi-sensor imagery is a challenging problem due to the difficulties associated with finding a correspondence between pixels from images taken by the...
Ju Han, Bir Bhanu
CVPR
2005
IEEE
16 years 4 days ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
GECCO
2003
Springer
15 years 3 months ago
Coarse-Graining in Genetic Algorithms: Some Issues and Examples
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
Andrés Aguilar Contreras, Jonathan E. Rowe,...