402 search results - page 38 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
118
Voted
KDD
2006
ACM
16 years 26 days ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
105
Voted
EMO
2003
Springer
15 years 5 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
99
Voted
HM
2009
Springer
15 years 5 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
114
Voted
AAAI
2010
15 years 1 months ago
2010
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...