3016 search results - page 279 / 604 » The Online Transportation Problem |
140
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
180
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
164
click to vote
IADIS
2004
15 years 7 months ago
2004
We have developed models of how strategies are constructed and retained as male and female high school and university students gain experience in solving online qualitative chemic...
172
click to vote
TC
2010
15 years 23 days ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
120
click to vote
ICDT
2007
ACM
16 years 5 days ago
2007
ACM
In this paper we investigate the problem of validating, with constant memory, streaming XML documents with respect to a DTD. Such constant memory validations can only be performed ...