Sciweavers

5592 search results - page 321 / 1119
» On Random Betweenness Constraints
Sort
View
TODAES
2008
47views more  TODAES 2008»
15 years 6 months ago
A tool for automatic detection of deadlock in wormhole networks on chip
We present an extension of Duato's necessary and sufficient condition a routing function must satisfy in order to be deadlock-free, to support environment constraints inducing...
Sami Taktak, Jean Lou Desbarbieux, Emmanuelle Encr...
ACL
2010
15 years 4 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
DLOG
2010
15 years 4 months ago
Guiding Reification in OWL through Aggregation
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
Paula Severi, José Luiz Fiadeiro, David Eks...
LPAR
2010
Springer
15 years 4 months ago
Pairwise Cardinality Networks
Abstract. We introduce pairwise cardinality networks, networks of comparators, derived from pairwise sorting networks, which express cardinality constraints. We show that pairwise ...
Michael Codish, Moshe Zazon-Ivry
IJIS
2010
110views more  IJIS 2010»
15 years 3 months ago
The ramification problem in temporal databases: Concurrent execution
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Dimitris Plexousakis, Grigoris An...