1182 search results - page 35 / 237 » Iterative Methods in Combinatorial Optimization |
SIAMJO
2000
15 years 1 months ago
2000
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that con...
107
click to vote
NIPS
2003
15 years 3 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
117
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
102
click to vote
CERA
2010
15 years 2 months ago
2010
Multilevel design problems are typically decomposed into a hierarchy of distributed and strongly coupled sub-problems, each solved by design teams with specialized knowledge and t...
118
click to vote
LPAR
2005
Springer
15 years 7 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...