Sciweavers

196 search results - page 1 / 40
» New Algorithms for Optimal Online Checkpointing
Sort
View
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 2 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther
SIGMOD
2011
ACM
193views Database» more  SIGMOD 2011»
12 years 6 months ago
Fast checkpoint recovery algorithms for frequently consistent applications
Advances in hardware have enabled many long-running applications to execute entirely in main memory. As a result, these applications have increasingly turned to database technique...
Tuan Cao, Marcos Antonio Vaz Salles, Benjamin Sowe...
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
13 years 7 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga
DCC
2010
IEEE
13 years 3 months ago
The cost of false alarms in Hellman and rainbow tradeoffs
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
Jin Hong
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 6 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...