108 search results - page 20 / 22 » Hybrid Transitive Closure Algorithms |
111
click to vote
BMCBI
2005
14 years 9 months ago
2005
Background: The sequencing of the human genome has enabled us to access a comprehensive list of genes (both experimental and predicted) for further analysis. While a majority of t...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
134
click to vote
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
86
Voted
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. ...