Sciweavers

1382 search results - page 22 / 277
» Formal Analysis of Online Algorithms
Sort
View
STACS
2009
Springer
16 years 14 days ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall
ICML
2010
IEEE
15 years 3 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
SCAM
2003
IEEE
15 years 11 months ago
Online Cycle Detection and Difference Propagation for Pointer Analysis
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
David J. Pearce, Paul H. J. Kelly, Chris Hankin
MKM
2004
Springer
15 years 11 months ago
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robe...
SPAA
2004
ACM
15 years 11 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson