Sciweavers

76 search results - page 7 / 16
» Counting Solutions of Knapsack Constraints
Sort
View
70
Voted
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 1 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
CP
2008
Springer
14 years 11 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
14 years 9 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
15 years 11 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
JPDC
2010
133views more  JPDC 2010»
14 years 4 months ago
Lock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
Alex Stivala, Peter J. Stuckey, Maria Garcia de la...