Sciweavers

1533 search results - page 206 / 307
» Semantic Matching: Algorithms and Implementation
Sort
View
MST
1998
91views more  MST 1998»
13 years 9 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
OWLED
2008
13 years 11 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves
CAV
2010
Springer
194views Hardware» more  CAV 2010»
14 years 1 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 4 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
14 years 3 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor