Results 1  10
of
244,432
BTRACE: Path optimization for debugging
, 2005
"... We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we nd a shortest path through the program's control ow graph that touches the maximum number of these nodes. Control ow graphs overapproximate real program behavior; by adding dat ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we nd a shortest path through the program's control ow graph that touches the maximum number of these nodes. Control ow graphs overapproximate real program behavior; by adding
SamplePath Optimization in Simulation
 In Proceedings of the Winter Simulation Conference
, 1994
"... This paper summarizes information about a method, called samplepath optimization, for optimizing performance functions in certain stochastic systems that can be modeled by simulation. We explain the method, give conditions under which it converges, and display some sample calculations that indicate ..."
Abstract
 Add to MetaCart
This paper summarizes information about a method, called samplepath optimization, for optimizing performance functions in certain stochastic systems that can be modeled by simulation. We explain the method, give conditions under which it converges, and display some sample calculations
Path Optimization for Single and Multiple Searchers: Models and Algorithms
, 2008
"... Path optimization for single and multiple searchers: models and algorithms ..."
Abstract
 Add to MetaCart
Path optimization for single and multiple searchers: models and algorithms
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using Fheaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worstcase bounds, where n is the number of vertices and m the number of edges
Depthfirst IterativeDeepening: An Optimal Admissible Tree Search
 Artificial Intelligence
, 1985
"... The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiwdeepening a ..."
Abstract

Cited by 527 (24 self)
 Add to MetaCart
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiw
Path Optimizations for Storage Systems
, 2009
"... In production industry there is a constant struggle for gaining higher efficiency, that also includes the storages and especially the buffer storages between the different machines in the production. As the demands for production flexibility increases as well as the efficiency demands, smarter stor ..."
Abstract
 Add to MetaCart
has been made. It includes proposed solutions to problems like route planning, collision avoidance and deadlock strategies. We also discuss advantages and disadvantages for different techniques, with the main goal of finding the optimal solutions for this specific task. Referat
Path Optimization for Graph Partitioning Problems
 Discrete Applied Mathematics. Combinatorial Algorithms, Optimization and Computer Science
, 1998
"... This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very wellknown algorithms for partitioning: the KernighanLin algorithm and simulated annealing. Our experiments are ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very wellknown algorithms for partitioning: the KernighanLin algorithm and simulated annealing. Our experiments
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 657 (27 self)
 Add to MetaCart
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route
Resilient Overlay Networks
, 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s widearea routing protocols that take at least several minutes to recover. A R ..."
Abstract

Cited by 1160 (31 self)
 Add to MetaCart
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s widearea routing protocols that take at least several minutes to recover. A
Results 1  10
of
244,432