2899 search results - page 414 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
218
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
169
click to vote
CC
2006
Springer
15 years 9 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
145
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
156
click to vote
SIGIR
2005
ACM
15 years 11 months ago
2005
ACM
We introduce a new model for semantic annotation and retrieval from image databases. The new model is based on a probabilistic formulation that poses annotation and retrieval as c...
142
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...