Sciweavers

4131 search results - page 159 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
146
Voted
SIAMJO
2008
175views more  SIAMJO 2008»
15 years 3 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
163
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 5 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
ECML
1993
Springer
15 years 7 months ago
Exploiting Context When Learning to Classify
This paper addresses the problem of classifying observations when features are context-sensitive, specifically when the testing set involves a context that is different from the t...
Peter D. Turney
128
Voted
LATIN
2010
Springer
15 years 1 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
138
Voted
ICPR
2010
IEEE
15 years 1 months ago
Verification Under Increasing Dimensionality
Verification decisions are often based on second order statistics estimated from a set of samples. Ongoing growth of computational resources allows for considering more and more fe...
Anne Hendrikse, Raymond N. J. Veldhuis, Luuk J. Sp...