Sciweavers

83 search results - page 11 / 17
» Boundary value problems on weighted networks
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 7 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
TSP
2010
13 years 2 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
PE
1998
Springer
158views Optimization» more  PE 1998»
13 years 7 months ago
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
Charles Knessl, Charles Tier
RAS
2002
168views more  RAS 2002»
13 years 7 months ago
Neural predictive control for a car-like mobile robot
: This paper presents a new path-tracking scheme for a car-like mobile robot based on neural predictive control. A multi-layer back-propagation neural network is employed to model ...
Dongbing Gu, Huosheng Hu
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...