Sciweavers

1953 search results - page 69 / 391
» Embedded Probabilistic Programming
Sort
View
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
15 years 2 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
OOPSLA
2007
Springer
15 years 8 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
LCPC
2000
Springer
15 years 5 months ago
Improving Offset Assignment for Embedded Processors
Embedded systems consisting of the application program ROM, RAM, the embedded processor core, and any custom hardware on a single wafer are becoming increasingly common in applicat...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
FMICS
2009
Springer
15 years 6 months ago
Platform-Specific Restrictions on Concurrency in Model Checking of Java Programs
The main limitation of software model checking is that, due to state explosion, it does not scale to real-world multi-threaded programs. One of the reasons is that current software...
Pavel Parizek, Tomás Kalibera
EMSOFT
2006
Springer
15 years 5 months ago
Implementing fault-tolerance in real-time systems by automatic program transformations
We present a formal approach to implement and certify fault-tolerance in real-time embedded systems. The faultintolerant initial system consists of a set of independent periodic t...
Tolga Ayav, Pascal Fradet, Alain Girault