Sciweavers

4355 search results - page 208 / 871
» Increasing Kolmogorov Complexity
Sort
View
RE
2005
Springer
15 years 4 months ago
Identifying Contingency Requirements Using Obstacle Analysis
This paper describes the use of Obstacle Analysis to identify anomaly-handling requirements for a safetycritical, autonomous system. The software requirements for the system evolv...
Robyn R. Lutz, Stacy Nelson, Ann Patterson-Hine, C...
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
15 years 4 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
DATE
2003
IEEE
137views Hardware» more  DATE 2003»
15 years 4 months ago
Dynamic Conditional Branch Balancing during the High-Level Synthesis of Control-Intensive Designs
We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps dynamically during scheduling to conditional branche...
Sumit Gupta, Nikil D. Dutt, Rajesh K. Gupta, Alexa...
ISCA
2003
IEEE
93views Hardware» more  ISCA 2003»
15 years 4 months ago
Improving Dynamic Cluster Assignment for Clustered Trace Cache Processors
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
Ravi Bhargava, Lizy Kurian John
SEMWEB
2009
Springer
15 years 3 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...