Sciweavers

1199 search results - page 132 / 240
» Graph Theory
Sort
View
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
16 years 3 days ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 11 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
SEMWEB
2005
Springer
15 years 11 months ago
A Strategy for Automated Meaning Negotiation in Distributed Information Retrieval
The paper reports on the formal framework to design strategies for multi-issue non-symmetric meaning negotiations among software agents in a distributed information retrieval syste...
Vadim Ermolayev, Natalya Keberle, Wolf-Ekkehard Ma...
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 5 months ago
sTeXIDE: An Integrated Development Environment for sTeX Collections
Authoring documents in MKM formats like OMDoc is a very tedious task. After years of working on a semantically annotated corpus of STEX documents (GenCS), we identified a set of co...
Constantin Jucovschi, Michael Kohlhase
SIGMETRICS
2004
ACM
107views Hardware» more  SIGMETRICS 2004»
15 years 11 months ago
On zone-balancing of peer-to-peer networks: analysis of random node join
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri L...