Sciweavers

875 search results - page 167 / 175
» Syndication on the Web using a description logic approach
Sort
View
ICALP
2009
Springer
15 years 11 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SPIN
2007
Springer
15 years 5 months ago
Tutorial: Parallel Model Checking
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
Lubos Brim, Jiri Barnat
BMCBI
2007
165views more  BMCBI 2007»
14 years 11 months ago
TagSmart: analysis and visualization for yeast mutant fitness data measured by tag microarrays
Background: A nearly complete collection of gene-deletion mutants (96% of annotated open reading frames) of the yeast Saccharomyces cerevisiae has been systematically constructed....
Chulyun Kim, Sangkyum Kim, Russell Dorer, Dan Xie,...
DLOG
2009
14 years 9 months ago
A Conflict-based Operator for Mapping Revision
Ontology matching is one of the key research topics in the field of the Semantic Web. There are many matching systems that generate mappings between different ontologies either aut...
Guilin Qi, Qiu Ji, Peter Haase
DLOG
2004
15 years 26 days ago
Towards Explaining Semantic Matching
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunc...