Sciweavers

24554 search results - page 246 / 4911
» Dependable distributed systems
Sort
View
RANDOM
1998
Springer
15 years 10 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
DLOG
2011
14 years 10 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
GIS
2009
ACM
15 years 10 months ago
A new perspective on efficient and dependable vehicle routing
The essential elements of any navigation system are a shortest-path algorithm and accurate map data. The contribution of this work is two-fold. First, the HBA algorithm, an effici...
Dieter Pfoser, Alexandros Efentakis, Agnès ...
ECOOP
2008
Springer
15 years 8 months ago
Modeling Context-Dependent Aspect Interference Using Default Logics
Explicitly representing aspect interactions is vital so that they can be shared and used in the course of system evolution. As a consequence, guidance can be given to the software ...
Frans Sanen, Eddy Truyen, Wouter Joosen
PRDC
2007
IEEE
16 years 21 days ago
On the Effects of Finite Memory on Intrusion-Tolerant Systems
Giuliana Santos Veronese, Miguel Correia, Lau Cheu...