16188 search results - page 358 / 3238 » The Optimal PAC Algorithm |
177
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
200
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
184
click to vote
IJCSA
2007
15 years 6 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
146
click to vote
ISVC
2007
Springer
16 years 27 days ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
164
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....