Sciweavers

1542 search results - page 33 / 309
» Kernelization of packing problems
Sort
View
ENDM
2010
84views more  ENDM 2010»
14 years 12 months ago
Formulation symmetries in circle packing
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
Alberto Costa, Leo Liberti, Pierre Hansen
IEICET
2010
124views more  IEICET 2010»
14 years 9 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
CIKM
2009
Springer
15 years 6 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
EOR
2007
147views more  EOR 2007»
14 years 11 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
ICML
2004
IEEE
16 years 19 days ago
A fast iterative algorithm for fisher discriminant using heterogeneous kernels
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao