3220 search results - page 499 / 644 » Constrained Graph Processes |
165
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
We present an approach to support the evolution of online, distributed, reusable, and extendable ontologies based on the RDF data model. The approach works on the basis of atomic c...
155
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
165
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...
178
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
182
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...