Sciweavers

276 search results - page 18 / 56
» Defining and computing accessibility radius
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ICNP
2006
IEEE
14 years 1 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
EUC
2004
Springer
14 years 1 months ago
Securing Communications in the Smart Home
As the vision of ubiquitous computing becomes reality smart devices are embedded into our surroundings and domestic appliances providing services transparently. The nature of such ...
Patroklos G. Argyroudis, Donal O'Mahony
LAWEB
2003
IEEE
14 years 1 months ago
Application Modeling for the Semantic Web
In this article we present a method for the design and implementation of Web Applications for the Semantic Web. Based on the "Object Oriented Hypermedia Design Method" a...
Fernanda Lima, Daniel Schwabe
EWDW
1994
13 years 11 months ago
Optimization of Object-Oriented Queries by Inverse Methods
For object-oriented databases we propose a new technique for optimizing queries containing method invocations. This technique is based on the definition of inverse methods and que...
Johann Eder, Heinz Frank, Walter Liebhart