Sciweavers

2214 search results - page 418 / 443
» Dynamic Protocol Recovery
Sort
View
WWW
2003
ACM
14 years 9 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...

Publication
211views
15 years 7 months ago
Congestion Avoidance in Computer Networks with A Connecitonless Network Layer: Part IV: A Selective Binary Feedback Scheme for G
With increasingly widespread use of computer networks, and the use of varied technology for the interconnection of computers, congestion is a significant problem. In this report, w...
K. Ramakrishnan and R. Jain,
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 10 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
WWW
2004
ACM
14 years 9 months ago
How to make a semantic web browser
Two important architectural choices underlie the success of the Web: numerous, independently operated servers speak a common protocol, and a single type of client--the Web browser...
D. A. Quan, R. Karger
SPAA
2009
ACM
14 years 9 months ago
A lightweight in-place implementation for software thread-level speculation
Thread-level speculation (TLS) is a technique that allows parts of a sequential program to be executed in parallel. TLS ensures the parallel program's behaviour remains true ...
Cosmin E. Oancea, Alan Mycroft, Tim Harris