Sciweavers

665 search results - page 128 / 133
» The Theory of Hybrid Automata
Sort
View
ACL
2010
13 years 5 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 5 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
DAM
2011
13 years 2 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 1 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
EUROPAR
2003
Springer
14 years 21 days ago
RECSY - A High Performance Library for Sylvester-Type Matrix Equations
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
Isak Jonsson, Bo Kågström