Sciweavers

9842 search results - page 1949 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
TABLEAUX
2005
Springer
14 years 29 days ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 29 days ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
VIZSEC
2005
Springer
14 years 29 days ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
VSTTE
2005
Springer
14 years 29 days ago
It Is Time to Mechanize Programming Language Metatheory
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...
CF
2004
ACM
14 years 28 days ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
« Prev « First page 1949 / 1969 Last » Next »