14548 search results - page 2468 / 2910 » The Optimal Path-Matching Problem |
190
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
206
click to vote
EDCC
2010
Springer
15 years 11 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
209
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
209
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
211
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
An important goal for the generative and developmental systems (GDS) community is to show that GDS approaches can compete with more mainstream approaches in machine learning (ML)....