Sciweavers

2473 search results - page 62 / 495
» The Logic of Communication Graphs
Sort
View
WWW
2005
ACM
14 years 8 months ago
Named graphs, provenance and trust
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
IEEEPACT
1998
IEEE
13 years 12 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
ICCAD
1997
IEEE
83views Hardware» more  ICCAD 1997»
13 years 12 months ago
Replication for logic bipartitioning
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...
Morgan Enos, Scott Hauck, Majid Sarrafzadeh
ITRUST
2005
Springer
14 years 1 months ago
A Representation Model of Trust Relationships with Delegation Extensions
Abstract. Logic languages establish a formal framework to solve authorization and delegation conflicts. However, we consider that a visual representation is necessary since graphs...
Isaac Agudo, Javier Lopez, José A. Monteneg...
FMCO
2003
Springer
102views Formal Methods» more  FMCO 2003»
14 years 27 days ago
Preserving Properties Under Change
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
Heike Wehrheim