Sciweavers

272 search results - page 32 / 55
» Simple versus optimal mechanisms
Sort
View

Publication
304views
15 years 6 months ago
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with Connectionless Network Layer
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the ...
K. Ramakrishnan and R. Jain
ISCC
2009
IEEE
129views Communications» more  ISCC 2009»
14 years 2 months ago
Handling dynamics in gossip-based aggregation schemes
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
Nicola Bicocchi, Marco Mamei, Franco Zambonelli
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
14 years 2 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
WCNC
2008
IEEE
14 years 2 months ago
A Resource Allocation Scheme for TH-UWB Networks with Multiple Sinks
Abstract—In this work, we study the time-slot allocation problem in a multi-sink single-hop TH-UWB network scenario, where the traffic from a sensor node is anycasted via a sing...
Hwee-Xian Tan, Mun-Choon Chan, Peng Yong Kong, Che...
ICANN
2007
Springer
14 years 2 months ago
Generalized Softmax Networks for Non-linear Component Extraction
Abstract. We develop a probabilistic interpretation of non-linear component extraction in neural networks that activate their hidden units according to a softmaxlike mechanism. On ...
Jörg Lücke, Maneesh Sahani