1092 search results - page 151 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
148
click to vote
WABI
2007
Springer
16 years 12 days ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
169
click to vote
IPPS
2006
IEEE
16 years 10 days ago
2006
IEEE
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
168
click to vote
GECCO
2005
Springer
15 years 11 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....
151
click to vote
CIDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
168
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...