Sciweavers

597 search results - page 97 / 120
» Open problems in data collection networks
Sort
View
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
MOBIHOC
2003
ACM
14 years 7 months ago
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...
Tara Small, Zygmunt J. Haas
TPDS
2010
126views more  TPDS 2010»
13 years 2 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ICDCS
2011
IEEE
12 years 7 months ago
Smart Redundancy for Distributed Computation
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
Yuriy Brun, George Edwards, Jae Young Bang, Nenad ...
WWW
2004
ACM
14 years 8 months ago
Session level techniques for improving web browsing performance on wireless links
Recent observations through experiments that we have performed in current third generation wireless networks have revealed that the achieved throughput over wireless links varies ...
Pablo Rodriguez, Sarit Mukherjee, Sampath Rangaraj...