13603 search results - page 260 / 2721 » On the Computational Complexity of Cut-Reduction |
157
click to vote
AAAI
2008
15 years 9 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
169
click to vote
WSC
2007
15 years 9 months ago
2007
Co-design modeling is considered key toward handling the complexity and scale of network systems. The ability to separately specify the software and hardware aspects of computer n...
183
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
231
click to vote
PDPTA
1997
15 years 8 months ago
1997
Abstract In future, parallel and distributed computing paradigms will replace nowadays predominant sequential and centralized ones. Facing the challenge to support the construction...
151
click to vote
WCE
2007
15 years 8 months ago
2007
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...