Sciweavers

60 search results - page 11 / 12
» Utilizing Formal Assertions for System Design of Network Pro...
Sort
View
RANDOM
1998
Springer
13 years 11 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
ICSE
2001
IEEE-ACM
14 years 17 min ago
A Web-Oriented Architectural Aspect for the Emerging Computational Tapestry
An emerging tapestry of computations will soon integrate systems around the globe. It will evolve without central control. Its complexity will be vast. We need new ideas, tools an...
Kevin J. Sullivan, Avneesh Saxena
RAS
2008
108views more  RAS 2008»
13 years 7 months ago
Towards long-lived robot genes
Robot projects are often evolutionary dead ends, with the software and hardware they produce disappearing without trace afterwards. Common causes include dependencies on uncommon ...
Paul M. Fitzpatrick, Giorgio Metta, Lorenzo Natale
HASE
2007
IEEE
14 years 1 months ago
SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
Jawwad Shamsi, Monica Brockmeyer
SAC
2008
ACM
13 years 7 months ago
XBird/D: distributed and parallel XQuery processing using remote proxy
In this paper, we focus on an aspect of distributed XQuery processing that involves data exchanges between processor elements. We first address problems of distributed XML query p...
Makoto Yui, Jun Miyazaki, Shunsuke Uemura, Hirokaz...