2489 search results - page 277 / 498 » On the Subgroup Distance Problem |
140
click to vote
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
141
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
123
click to vote
EWCBR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Effective encoding of information is one of the keys to qualitative problem solving. Our aim is to explore Knowledge representation techniques that capture meaningful wor...
149
click to vote
HIS
2004
15 years 5 months ago
2004
In this work, we proposed to use the Zoomed Ranking approach to rank and select time series models. Zoomed Ranking, originally proposed to generate a ranking of candidate algorith...
135
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...