Sciweavers

203 search results - page 9 / 41
» Real Arguments Are Approximate Arguments
Sort
View
CSFW
2007
IEEE
14 years 1 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
FORMATS
2009
Springer
14 years 2 months ago
Analyzing Real-Time Event-Driven Programs
Embedded real-time systems are typically programmed in low-level languages which provide support for event-driven task processing and real-time interrupts. We show that the model c...
Pierre Ganty, Rupak Majumdar
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
14 years 4 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Noa Avigdor-Elgrabli, Yuval Rabani
CIE
2006
Springer
13 years 11 months ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
QUESTA
2008
205views more  QUESTA 2008»
13 years 7 months ago
Continuity of the M/G/c queue
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
Lothar Breuer