1542 search results - page 37 / 309 » Kernelization of packing problems |
105
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
SKG
2006
IEEE
15 years 5 months ago
2006
IEEE
Convolution kernels, such as tree kernel and subsequence kernel are useful for natural language processing tasks. However, most of them ignore the semantic knowledge. In order to ...
106
click to vote
EOR
2007
14 years 11 months ago
2007
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
DAGSTUHL
1996
15 years 1 months ago
1996
Abstract. This paper describes a compiler generator (cogen) designed for interactive graphics, and presents preliminary results of its application to pixel-level code. The cogen ac...
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...