Sciweavers

6355 search results - page 1179 / 1271
» From Logic to Games
Sort
View
STACS
2010
Springer
16 years 1 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
ASUNAM
2009
IEEE
16 years 1 months ago
Dynamics of Inter-Meeting Time in Human Contact Networks
—We envision new communication paradigms, using physical dynamic interconnectedness among people. Delay Tolerant Networks (DTNs) are a new communication paradigm to support such ...
Eiko Yoneki, Dan Greenfield, Jon Crowcroft
DATE
2009
IEEE
168views Hardware» more  DATE 2009»
16 years 1 months ago
Selective state retention design using symbolic simulation
Abstract—Addressing both standby and active power is a major challenge in developing System-on-Chip designs for batterypowered products. Powering off sections of logic or memorie...
Ashish Darbari, Bashir M. Al-Hashimi, David Flynn,...
DSN
2009
IEEE
16 years 1 months ago
Low overhead Soft Error Mitigation techniques for high-performance and aggressive systems
The threat of soft error induced system failure in high performance computing systems has become more prominent, as we adopt ultra-deep submicron process technologies. In this pap...
Naga Durga Prasad Avirneni, Viswanathan Subramania...
MICRO
2009
IEEE
147views Hardware» more  MICRO 2009»
16 years 1 months ago
Complexity effective memory access scheduling for many-core accelerator architectures
Modern DRAM systems rely on memory controllers that employ out-of-order scheduling to maximize row access locality and bank-level parallelism, which in turn maximizes DRAM bandwid...
George L. Yuan, Ali Bakhoda, Tor M. Aamodt
« Prev « First page 1179 / 1271 Last » Next »