9842 search results - page 1641 / 1969 » The Complexity of the Matching-Cut Problem |
149
click to vote
EUROPAR
2005
Springer
16 years 6 days ago
2005
Springer
In H.264/AVC [1], integer transforms are applied instead of the 8×8 discrete cosine transform (DCT) of previous standards to avoid inverse transform mismatch problems. However, th...
157
Voted
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
166
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
186
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...
161
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...