Sciweavers

5214 search results - page 60 / 1043
» The Online Specialization Problem
Sort
View
ORL
2008
87views more  ORL 2008»
13 years 6 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
ICALP
2001
Springer
14 years 4 days ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
SIGMOD
2009
ACM
168views Database» more  SIGMOD 2009»
14 years 8 months ago
Database research in computer games
This tutorial presents an overview of the data management issues faced by computer games today. While many games do not use databases directly, they still have to process large am...
Alan J. Demers, Johannes Gehrke, Christoph Koch, B...
AH
2004
Springer
14 years 1 months ago
Adaptive Navigation for Self-assessment Quizzes
Web-based parameterized quizzes provide teachers and students with several advantages as the technology for self-assessment. However, the effect of these advantages is strongly red...
Sergey A. Sosnovsky
ALT
2006
Springer
13 years 11 months ago
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...
Chamy Allenberg, Peter Auer, László ...