828 search results - page 99 / 166 » Bounded Hairpin Completion |
CORR
2009
Springer
13 years 7 months ago
2009
Springer
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...
CN
2010
13 years 6 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
ASPLOS
2011
ACM
13 years 1 months ago
2011
ACM
The adoption of transactional memory is hindered by the high overhead of software transactional memory and the intrusive design changes required by previously proposed TM hardware...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
POPL
2011
ACM
13 years 26 days ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...