4860 search results - page 486 / 972 » SNPs Problems, Complexity, and Algorithms |
111
Voted
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Embedded system secondary storage size is often constrained, yet storage demands are growing as a result of increasing application complexity and storage of personal dat...
148
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
132
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
129
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
132
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...