15485 search results - page 204 / 3097 » Computing Optimal Subsets |
157
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
136
click to vote
JPDC
2006
15 years 6 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
169
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Given a query iris image, the goal of indexing is to identify and retrieve a small subset of candidate irides from the database in order to determine a possible match. This can si...
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we describe a Torah Code experiment which: ? Focuses on a famous contemporary event. ? Has a simple and explicit data collection. ? Has considerably simpler measurem...
158
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This work is about scene interpretation in the sense of detecting and localizing instances from multiple object classes. We concentrate on object indexing: generate an over-comple...