1144 search results - page 154 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
IJCAI
2003
14 years 11 months ago
2003
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
IEICET
2006
14 years 9 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
A variant of the k-nearest neighbor algorithm is proposed for image interpolation. Instead of using a static volume or static k, the proposed algorithm determines a dynamic k that...