Sciweavers

370 search results - page 69 / 74
» Bounded modified realizability
Sort
View
COLT
2005
Springer
13 years 10 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour
DAGSTUHL
2007
13 years 10 months ago
Interdisciplinary Design Research for End-User Software Engineering
rocesses involve modeling – simplifying or abstracting some aspects of the problem domain in order to plan and evaluate design decisions. The use of representations to reason abo...
Alan F. Blackwell
OPODIS
2008
13 years 10 months ago
Solving Atomic Multicast When Groups Crash
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
Nicolas Schiper, Fernando Pedone
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
TCAD
2008
136views more  TCAD 2008»
13 years 8 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar