12825 search results - page 367 / 2565 » Improved PLSOM algorithm |
188
Voted
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Many engineering optimization tasks involve finding more than one optimum solution. The present study provides a comprehensive review of the existing work done in the field of mul...
168
click to vote
IJCAI
2007
15 years 8 months ago
2007
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
180
click to vote
CCCG
2006
15 years 8 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
221
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
202
click to vote
TSMC
2008
15 years 7 months ago
2008
Abstract--This paper proposes algorithms for iris segmentation, quality enhancement, match score fusion, and indexing to improve both the accuracy and the speed of iris recognition...