Sciweavers

2210 search results - page 375 / 442
» Information complexity of neural networks
Sort
View
IPTPS
2005
Springer
15 years 12 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
PODC
2003
ACM
15 years 11 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
DEBS
2008
ACM
15 years 7 months ago
An adaptive approach for ensuring reliability in event based middleware
In this effort we tackle the important issue of providing Quality of Service (QoS) guarantees to subscribers, when routing event notifications in a publish-subscribe domain. In ...
Shruti P. Mahambre, Umesh Bellur
NETWORKS
2008
15 years 6 months ago
Decontamination of hypercubes by mobile agents
In this paper we consider the decontamination problem in a hypercube network of size n. The nodes of the network are assumed to be contaminated and they have to be decontaminated ...
Paola Flocchini, Miao Jun Huang, Flaminia L. Lucci...
DAWAK
2001
Springer
15 years 10 months ago
Matchmaking for Structured Objects
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
Thomas Eiter, Daniel Veit, Jörg P. Mülle...