Results 1  10
of
253,584
ON INDEPENDENT SETS AND NONAUGMENTABLE PATHS IN DIRECTED GRAPHS
"... We investigate sucient conditions, and in case that D be an asymmetrical digraph a necessary and sucient condition for a digraph to have the following property: \In any induced subdigraph H of D, every maximal independent set meets every nonaugmentable path". Also we obtain a necessary and su ..."
Abstract
 Add to MetaCart
We investigate sucient conditions, and in case that D be an asymmetrical digraph a necessary and sucient condition for a digraph to have the following property: \In any induced subdigraph H of D, every maximal independent set meets every nonaugmentable path". Also we obtain a necessary
Cardinality matching: Heuristic search for augmenting paths
, 1995
"... A new heuristic for the cardinality matching problem is given and compared with different greedy heuristics. A modified depth first search is used to search heuristically for an augmenting path with respect to a given matching. In a large number of testruns on randomly generated graphs, our heurist ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A new heuristic for the cardinality matching problem is given and compared with different greedy heuristics. A modified depth first search is used to search heuristically for an augmenting path with respect to a given matching. In a large number of testruns on randomly generated graphs, our
Massively Parallel Augmenting Path Algorithms for the Assignment Problem
, 1996
"... In this paper we describe how to apply fine grain parallelism to augmenting path algorithms for the dense linear assignment problem. We prove by doing that the technique we suggest, can be efficiently implemented on commercial available, massively parallel computers. Using n processors, our method r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we describe how to apply fine grain parallelism to augmenting path algorithms for the dense linear assignment problem. We prove by doing that the technique we suggest, can be efficiently implemented on commercial available, massively parallel computers. Using n processors, our method
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 565 (0 self)
 Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties
Evolving Neural Networks through Augmenting Topologies
 Evolutionary Computation
"... An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixedtopology method on a challenging benchmark reinforcement learning task ..."
Abstract

Cited by 524 (113 self)
 Add to MetaCart
An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixedtopology method on a challenging benchmark reinforcement learning
A Survey of Augmented Reality
, 1997
"... This paper surveys the field of Augmented Reality, in which 3D virtual objects are integrated into a 3D real environment in real time. It describes the medical, manufacturing, visualization, path planning, entertainment and military applications that have been explored. This paper describes the ch ..."
Abstract

Cited by 446 (0 self)
 Add to MetaCart
This paper surveys the field of Augmented Reality, in which 3D virtual objects are integrated into a 3D real environment in real time. It describes the medical, manufacturing, visualization, path planning, entertainment and military applications that have been explored. This paper describes
Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
, 2006
"... This paper considers two similar graph algorithms that work by repeatedly increasing “flow” along “augmenting paths”: the FordFulkerson algorithm for the maximum flow problem and the GaleShapley algorithm for the stable allocation problem (a manytomany generalization of the stable matching probl ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This paper considers two similar graph algorithms that work by repeatedly increasing “flow” along “augmenting paths”: the FordFulkerson algorithm for the maximum flow problem and the GaleShapley algorithm for the stable allocation problem (a manytomany generalization of the stable matching
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1078 (5 self)
 Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
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 (34 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
Results 1  10
of
253,584