2373 search results - page 416 / 475 » On the Theory of Structural Subtyping |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
STOC
2004
ACM
15 years 10 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. ...
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...