7106 search results - page 944 / 1422 » Restricted Complexity, General Complexity |
172
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
174
click to vote
ICANNGA
2009
Springer
16 years 1 months ago
2009
Springer
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
216
click to vote
ICANNGA
2009
Springer
16 years 1 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
191
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Many bioinformatics studies require the analysis of RNA or DNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D fold...
185
click to vote
ICVS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...