Sciweavers

11 search results - page 1 / 3
» Primal and dual neural networks for shortest-path routing
Sort
View
EOR
2008
106views more  EOR 2008»
14 years 10 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
CISS
2008
IEEE
15 years 4 months ago
Modelling multi-path problems
—In this paper we consider the behaviour of both primal and dual multi-path algorithms for a simple network of three resources. We examine the equilibrium behaviour of our models...
Richard J. Gibbens
TWC
2008
135views more  TWC 2008»
14 years 9 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
PDP
2005
IEEE
15 years 3 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz