1289 search results - page 31 / 258 » Complexity of Counting the Optimal Solutions |
TEC
2008
13 years 11 months ago
2008
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for ...
AAECC
2007
Springer
14 years 5 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...