1943 search results - page 228 / 389 » Ordering Default Theories |
203
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
351
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
192
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
186
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
181
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...