1206 search results - page 73 / 242 » Convergence analysis of online algorithms |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
NIPS
2004
14 years 11 months ago
2004
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
COCOON
2006
Springer
15 years 1 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...
104
click to vote
AIED
2011
Springer
14 years 1 months ago
2011
Springer
The Pedagogical Assessment Workflow System (PAWS) is a new workflow-based pedagogical assessment framework that enables the efficient and robust integration of diverse datasets for...
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...