1772 search results - page 319 / 355 » Classifying Problems into Complexity Classes |
GECCO
2008
Springer
13 years 8 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
DATAMINE
2006
13 years 7 months ago
2006
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
IJCV
2006
13 years 7 months ago
2006
Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, ...