443 search results - page 3 / 89 » Analysis of Heuristics for Number Partitioning |
IPCO
2007
13 years 9 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
JCO
2002
13 years 7 months ago
2002
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
DAC
1997
ACM
13 years 11 months ago
1997
ACM
Recent work [2] [5] [11] [12] [14] has illustrated the promise of multilevel approaches for partitioning large circuits. Multilevel partitioning recursively clusters the instance ...
IJCAI
2001
13 years 9 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...