Results 1  10
of
11,752
Asymptotic Analysis of the Flow Deviation Method for the Maximum Concurrent Flow Problem
 Mathematical Programming
, 2000
"... We analyze the asymptotic behavior of the Flow Deviation Method, rst presented in 1971 by Fratta, Gerla and Kleinrock, and show that when applied to packing linear programs such as the maximum concurrent ow problem, it yields a fully polynomialtime approximation scheme. 1 ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We analyze the asymptotic behavior of the Flow Deviation Method, rst presented in 1971 by Fratta, Gerla and Kleinrock, and show that when applied to packing linear programs such as the maximum concurrent ow problem, it yields a fully polynomialtime approximation scheme. 1
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
Synchronous data flow
, 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract

Cited by 622 (45 self)
 Add to MetaCart
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRNâ€™s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 949 (19 self)
 Add to MetaCart
region. Implications of the results in certain types of concurrent database and parallel processing systems are discussed. I.
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
 Machine Learning
, 1998
"... . This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract

Cited by 483 (43 self)
 Add to MetaCart
. This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1315 (53 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2704 (56 self)
 Add to MetaCart
call statecharts, extend conventional statetransition diagrams with essentially three olements, dealing, respectively, with the notions of hierarchy, concurrency and communication. These transform the language of state diagrams into a highly structured' and economical description language
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drainout is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem
Brain magnetic resonance imaging with contrast dependent on blood oxygenation.
 Proc. Natl. Acad. Sci. USA
, 1990
"... ABSTRACT Paramagnetic deoxyhemoglobin in venous blood is a naturally occurring contrast agent for magnetic resonance imaging (MRI). By accentuating the effects of this agent through the use of gradientecho techniques in high fields, we demonstrate in vivo images of brain microvasculature with imag ..."
Abstract

Cited by 648 (1 self)
 Add to MetaCart
with image contrast reflecting the blood oxygen level. This blood oxygenation leveldependent (BOLD) contrast follows blood oxygen changes induced by anesthetics, by insulininduced hypoglycemia, and by inhaled gas mixtures that alter metabolic demand or blood flow. The results suggest that BOLD contrast can
Results 1  10
of
11,752