ANOR
2008
13 years 12 months ago
2008
We study a single-router Network-on-Chip modelled as a tandem queueing network. The first node is a geoK /D/1 queue (K fixed) representing a network interface, and the second node...
ADHOC
2007
13 years 12 months ago
2007
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signiï¬...
ADHOC
2008
13 years 12 months ago
2008
In this paper we present a novel probabilistic protocol for path discovery in Mobile Ad Hoc Networks (MANETs). The protocol implements what we call a polarized gossiping algorithm...
CONEXT
2009
ACM
14 years 29 days ago
2009
ACM
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
ATAL
2010
Springer
14 years 29 days ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
WCE
2007
14 years 1 months ago
2007
– Maintenance of the cache consistency is a complicated issue in the wireless mobile environment. Caching of frequently accessed data items on the node can reduce the bandwidth r...
AAAI
1990
14 years 1 months ago
1990
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
IICAI
2003
14 years 1 months ago
2003
Abstract. We introduce a new genetic algorithm approach for learning a Bayesian network structure from data. Our method is capable of learning over all node orderings and structure...
SIROCCO
2001
14 years 1 months ago
2001
An Interval Routing Scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assig...
OPODIS
2004
14 years 1 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...