Sciweavers

10901 search results - page 2001 / 2181
» Approximations in Distributed Optimization
Sort
View
ADHOC
2008
183views more  ADHOC 2008»
15 years 4 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
144
Voted
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
15 years 4 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
COR
2010
177views more  COR 2010»
15 years 4 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
128
Voted
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 4 months ago
Node Disjoint Multipath Routing Considering Link and Node Stability protocol: A characteristic Evaluation
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or ene...
Shuchita Upadhayaya, Charu Gandhi
130
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Linear Operator Channels over Finite Fields
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
Shenghao Yang, Siu-Wai Ho, Jin Meng, En-Hui Yang
« Prev « First page 2001 / 2181 Last » Next »