Sciweavers

1132 search results - page 162 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ICC
1997
IEEE
108views Communications» more  ICC 1997»
15 years 10 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
15 years 10 months ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
CPAIOR
2006
Springer
15 years 10 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
DATE
2008
IEEE
163views Hardware» more  DATE 2008»
15 years 8 months ago
A Simulation Methodology for Worst-Case Response Time Estimation of Distributed Real-Time Systems
In this paper, we propose a simulation-based methodology for worst-case response time estimation of distributed realtime systems. Schedulability analysis produces pessimistic uppe...
Soheil Samii, Sergiu Rafiliu, Petru Eles, Zebo Pen...