Sciweavers

245 search results - page 42 / 49
» Locating phase transitions in computationally hard problems
Sort
View
BIRTHDAY
2010
Springer
13 years 8 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 7 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
SC
1995
ACM
13 years 11 months ago
Input/Output Characteristics of Scalable Parallel Applications
Rapid increases in computing and communication performance are exacerbating the long-standing problem of performance-limited input/output. Indeed, for many otherwise scalable para...
Phyllis Crandall, Ruth A. Aydt, Andrew A. Chien, D...
NSDI
2008
13 years 10 months ago
Beyond Pilots: Keeping Rural Wireless Networks Alive
Very few computer systems that have been deployed in rural developing regions manage to stay operationally sustainable over the long term; most systems do not go beyond the pilot ...
Sonesh Surana, Rabin K. Patra, Sergiu Nedevschi, M...
SPAA
2006
ACM
14 years 1 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler