Sciweavers

26354 search results - page 182 / 5271
» How we refactor, and how we know it
Sort
View
RTSS
2003
IEEE
14 years 4 months ago
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
Dakai Zhu, Daniel Mossé, Rami G. Melhem
COMPSAC
2009
IEEE
14 years 3 months ago
How Well Do Test Case Prioritization Techniques Support Statistical Fault Localization
—In continuous integration, a tight integration of test case prioritization techniques and fault-localization techniques may both expose failures faster and locate faults more ef...
Bo Jiang, Zhenyu Zhang, T. H. Tse, Tsong Yueh Chen
PPOPP
2009
ACM
14 years 3 months ago
Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions
Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted tran...
Chinmay Eishan Kulkarni, Osman S. Unsal, Adri&aacu...
CARDIS
2000
Springer
150views Hardware» more  CARDIS 2000»
14 years 3 months ago
How to Turn a GSM SIM into a Web Server
: We describe the WebSIM, an approach that integrates GSM SIMs into the Internet. The underlying idea is to implement a Web Server inside a SIM, and to allow for transparent access...
Scott B. Guthery, Roger Kehr, Joachim Posegga
ECCV
2000
Springer
14 years 3 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth