Results 1 - 10 of 69,430

Efficient Continuous-Time Dynamic Network Flow Algorithms

by L. Fleischer, Éva Tardos - OPERATIONS RESEARCH LETTERS , 1998
"... We extend the discrete-time dynamic flow algorithms presented in the literature to solve the analogous continuous-time dynamic flow problems. These problems include finding maximum dynamic flows, quickest flows, universally maximum dynamic flows, lexicographically maximum dynamic flows, dynamic tran ..."
Abstract - Cited by 23 (3 self) - Add to MetaCart
We extend the discrete-time dynamic flow algorithms presented in the literature to solve the analogous continuous-time dynamic flow problems. These problems include finding maximum dynamic flows, quickest flows, universally maximum dynamic flows, lexicographically maximum dynamic flows, dynamic

Continuous-Time Dynamic Shortest Path Algorithms

by Brian C. Dean , 1999
"... We consider the problem of computing shortest paths through a dynamic network – a network with time-varying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic beha ..."
Abstract - Cited by 26 (1 self) - Add to MetaCart
behavior over the course of time. Dynamic shortest path problems are currently solved in practice by algorithms which operate within a discrete-time framework. In this thesis, we introduce a new set of algorithms for computing shortest paths in continuous-time dynamic networks, and demonstrate

Dynamic source routing in ad hoc wireless networks

by David B. Johnson, David A. Maltz - Mobile Computing , 1996
"... An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its desti ..."
Abstract - Cited by 3108 (31 self) - Add to MetaCart
destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods

Dynamic Bayesian Networks: Representation, Inference and Learning

by Kevin Patrick Murphy , 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and bio-sequence analysis, and KFMs have bee ..."
Abstract - Cited by 770 (3 self) - Add to MetaCart
been used for problems ranging from tracking planes and missiles to predicting the economy. However, HMMs and KFMs are limited in their “expressive power”. Dynamic Bayesian Networks (DBNs) generalize HMMs by allowing the state space to be represented in factored form, instead of as a single discrete

A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks

by Elizabeth M. Royer, Chai-Keong Toh
"... An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discove ..."
Abstract - Cited by 1311 (3 self) - Add to MetaCart
An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used

Alliances and networks

by Ranjay Gulati
"... This paper introduces a social network perspective to the study of strategic alliances. It extends prior research, which has primarily considered alliances as dyadic exchanges and paid less attention to the fact that key precursors, processes, and outcomes associated with alliances can be defined an ..."
Abstract - Cited by 833 (6 self) - Add to MetaCart
and shaped in important ways by the social networks within which most firms are embedded. It identifies five key issues for the study of alliances: (1) the formation of alliances, (2) the choice of governance structure, (3) the dynamic evolution of alliances, (4) the performance of alliances, and (5

Dynamic Fine-grained Localization in Ad-Hoc Networks of Sensors

by Andreas Savvides, Chih-chieh Han, Mani B. Srivastava - PROCEEDINGS OF THE SEVENTH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, MOBICOM 2001 , 2001
"... ..."
Abstract - Cited by 818 (10 self) - Add to MetaCart
Abstract not found

The Evolution of Social and Economic Networks

by Matthew O. Jackson, Alison Watts - JOURNAL OF ECONOMIC THEORY 106, 265–295 , 2002
"... We examine the dynamic formation and stochastic evolution of networks connecting individuals. The payoff to an individual from an economic or social activity depends on the network of connections among individuals. Over time individuals form and sever links connecting themselves to other individuals ..."
Abstract - Cited by 889 (37 self) - Add to MetaCart
We examine the dynamic formation and stochastic evolution of networks connecting individuals. The payoff to an individual from an economic or social activity depends on the network of connections among individuals. Over time individuals form and sever links connecting themselves to other

The structure and function of complex networks

by M. E. J. Newman - SIAM REVIEW , 2003
"... Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, ..."
Abstract - Cited by 2600 (7 self) - Add to MetaCart
, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.

by David B Johnson , David A Maltz , Josh Broch - Perkins, Chapter , 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract - Cited by 764 (8 self) - Add to MetaCart
Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network
Results 1 - 10 of 69,430