2489 search results - page 353 / 498 » On the Subgroup Distance Problem |
151
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
162
click to vote
PRICAI
2000
Springer
15 years 7 months ago
2000
Springer
Autonomous state generalization problem is a key issue in the research field of behavior learning of reactive agents, and many approaches have been proposed in recent years. Howeve...
124
Voted
AIPS
2008
15 years 6 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
115
click to vote
AUSDM
2008
Springer
15 years 5 months ago
2008
Springer
Given the threat of re-identification in our growing digital society, guaranteeing privacy while providing worthwhile data for knowledge discovery has become a difficult problem. ...
148
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...