Sciweavers

3229 search results - page 347 / 646
» The Theory of Timed Automata
Sort
View
ECRTS
2010
IEEE
15 years 8 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
ICPR
2006
IEEE
16 years 8 months ago
Onset Detection through Maximal Redundancy Detection
We propose a criterion, called `maximal redundancy', for onset detection in time series. The concept redundancy is adopted from information theory and indicates how well a si...
Gert Van Dijck, Marc M. Van Hulle
DAC
2005
ACM
16 years 7 months ago
Incremental retiming for FPGA physical synthesis
In this paper, we present a new linear-time retiming algorithm that produces near-optimal results. Our implementation is specifically targeted at Altera's Stratix [1] FPGAbas...
Deshanand P. Singh, Valavan Manohararajah, Stephen...
WWW
2008
ACM
16 years 7 months ago
Speeding up web service composition with volatile external information
This paper introduces a novel method for composing Web services in the presence of external volatile information. Our approach, which we call the informed-presumptive, is compared...
John Harney, Prashant Doshi
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 7 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein