Sciweavers

1298 search results - page 74 / 260
» The online set cover problem
Sort
View
EOR
2007
95views more  EOR 2007»
15 years 6 months ago
A hybrid genetic algorithm for the two-dimensional single large object placement problem
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
Eleni Hadjiconstantinou, Manuel Iori
FOCS
2005
IEEE
16 years 10 hour ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 10 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
COLT
2007
Springer
16 years 17 days ago
Online Learning with Prior Knowledge
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setti...
Elad Hazan, Nimrod Megiddo
EUROCOLT
1995
Springer
15 years 10 months ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire