233 search results - page 19 / 47 » On Some Optimization Heuristics for Lesk-Like WSD Algorithms |
ER
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
GECCO
2004
Springer
2004
Springer
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
14 years 1 months ago
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
EVOW
2010
Springer
14 years 21 days ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
LION
2009
Springer
14 years 2 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...