9842 search results - page 1799 / 1969 » The Complexity of the Matching-Cut Problem |
126
Voted
SARA
2007
Springer
15 years 9 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
115
Voted
SEKE
2007
Springer
15 years 9 months ago
2007
Springer
Peer-to-Peer (P2P) systems seek to provide sharing of computational resources, which may be duplicated or versioned over several peers. Duplicate resources (i.e. replicas) are the...
124
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating...
105
Voted
TACAS
2007
Springer
15 years 9 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
110
Voted
WABI
2007
Springer
15 years 9 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...