Sciweavers

4565 search results - page 681 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
MST
2000
57views more  MST 2000»
15 years 2 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 3 months ago
Sequential cost-sensitive decision making with reinforcement learning
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
Edwin P. D. Pednault, Naoki Abe, Bianca Zadrozny
EUROSYS
2006
ACM
16 years 2 days ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
IEEEPACT
2006
IEEE
15 years 9 months ago
Fast, automatic, procedure-level performance tuning
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...
Zhelong Pan, Rudolf Eigenmann
113
Voted
BIRTHDAY
2003
Springer
15 years 8 months ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...