Sciweavers

5639 search results - page 5 / 1128
» Timed Abstract Non-interference
Sort
View
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
14 years 9 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
CORR
2012
Springer
191views Education» more  CORR 2012»
13 years 10 months ago
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
Patrick Bindjeme, James Allen Fill
116
Voted
CDC
2010
IEEE
14 years 9 months ago
Synthesis using approximately bisimilar abstractions: time-optimal control problems
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
Antoine Girard
TIME
2005
IEEE
15 years 7 months ago
Temporal Logic with Predicate lambda-Abstraction
Alexei Lisitsa, Igor Potapov
86
Voted
TIME
2002
IEEE
15 years 7 months ago
Temporal Views as Abstract Relations
Allan Ramsay