Sciweavers

196 search results - page 27 / 40
» New Algorithms for Optimal Online Checkpointing
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
IPPS
2003
IEEE
14 years 20 days ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
COLT
2007
Springer
14 years 1 months ago
Learning Permutations with Exponential Weights
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
David P. Helmbold, Manfred K. Warmuth
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
13 years 11 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...