Sciweavers

3169 search results - page 299 / 634
» Robust Timed Automata
Sort
View
190
Voted
PE
2010
Springer
137views Optimization» more  PE 2010»
15 years 5 months ago
Tail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
Jayakrishnan Nair, Adam Wierman, Bert Zwart
TSMC
2010
15 years 1 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi
ICASSP
2008
IEEE
16 years 1 months ago
Reconstructing sparse signals from their zero crossings
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
Petros Boufounos, Richard G. Baraniuk
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 8 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
CADE
2002
Springer
16 years 7 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...