233 search results - page 21 / 47 » On Some Optimization Heuristics for Lesk-Like WSD Algorithms |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
ENTCS
2010
13 years 7 months ago
2010
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
DMIN
2008
13 years 9 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...