1542 search results - page 43 / 309 » Kernelization of packing problems |
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
This paper presents an application of multiple kernels like Kernel Basis to the Relevance Vector Machine algorithm. The framework of kernel machines has been a source of many works...
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
DISOPT
2008
14 years 12 months ago
2008
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
ESA
2010
Springer
15 years 14 hour ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
114
click to vote
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 4 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...