Sciweavers

4940 search results - page 207 / 988
» On the Complexity of Universal Programs
Sort
View
EUROSYS
2011
ACM
14 years 10 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
DEXAW
2003
IEEE
106views Database» more  DEXAW 2003»
15 years 11 months ago
How to Program Pervasive Systems
As users, computers, data and processes become increasingly mobile and the diversity of interacting devices increases, pervasive computing tasks are difficult to predict and to u...
Andry Rakotonirainy
CAISE
2003
Springer
15 years 11 months ago
Computing Event Dependencies in System Designs and Programs
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
Bruc Lee Liong, Leszek A. Maciaszek
HPCA
2004
IEEE
16 years 6 months ago
Accurate and Complexity-Effective Spatial Pattern Prediction
Recent research suggests that there are large variations in a cache's spatial usage, both within and across programs. Unfortunately, conventional caches typically employ fixe...
Chi F. Chen, Se-Hyun Yang, Babak Falsafi, Andreas ...
CP
2007
Springer
16 years 19 days ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...