2899 search results - page 300 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
184
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
178
Voted
AIPS
2007
15 years 9 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
176
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
193
click to vote
ICMCS
2005
IEEE
16 years 7 days ago
2005
IEEE
The major complexity source in H.264 is the rate distortion (R-D) optimization. This work proposes a method to reduce the complexity of R-D analysis, paying a little video degrada...
194
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...