Sciweavers

392 search results - page 10 / 79
» Reversal Complexity Revisited
Sort
View
AMW
2010
13 years 9 months ago
Minimising RDF Graphs under Rules and Constraints Revisited
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
ALGOSENSORS
2009
Springer
14 years 2 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
CEC
2009
IEEE
14 years 2 months ago
Bio-inspired reverse engineering of regulatory networks
— Regulatory networks are complex networks. This paper addresses the challenge of modelling these networks. The Boolean representation is chosen and supported as a representation...
Cristina Costa Santini, Gunnar Tufte, Pauline C. H...
IWPC
2002
IEEE
14 years 12 days ago
An Open Visualization Toolkit for Reverse Architecting
Maintenance and evolution of complex software systems (such as large telecom embedded devices) involve activities such as reverse engineering (RE) and software visualization. Alth...
Alexandru Telea, Alessandro Maccari, Claudio Riva
CONPAR
1992
13 years 11 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault