Results 1  10
of
628
Dynamic programming on tree decompositions using generalised fast subset convolution
 Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009
"... Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that, for a graph, given with a tree decomposition of width k, solve the dominated set problem in O(nk23k) tim ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that, for a graph, given with a tree decomposition of width k, solve the dominated set problem in O(nk23k
Minimum Size TreeDecompositions?
"... Abstract. TreeDecompositions are the cornerstone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute treedecomposition ..."
Abstract
 Add to MetaCart
Abstract. TreeDecompositions are the cornerstone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute treedecompositions
Tree/Branch Decompositions and Their Applications
"... The notions of tree decompositions and branch decompositions have received much attention in discrete optimizations. These notions were originally introduced by Robertson and Seymour [15, 16] in the proof of the Graph Minors Theorem, known as Wagner’s conjecture. It is known that practical problems ..."
Abstract
 Add to MetaCart
] and Arnborg et al. [3] showed that several NPhard problems on graphs can be solved in polynomial time using dynamic programming techniques if the graphs have bounded treewidth or branchwidth. There are two major steps in the techniques of [9, 3]: (1) compute a tree/branch decomposition with small treewidth
Efficient Solution Algorithms for Factored MDPs
, 2003
"... This paper addresses the problem of planning under uncertainty in large Markov Decision Processes (MDPs). Factored MDPs represent a complex state space using state variables and the transition model using a dynamic Bayesian network. This representation often allows an exponential reduction in the re ..."
Abstract

Cited by 172 (3 self)
 Add to MetaCart
programming, and the second approximate dynamic programming. Our dynamic programming algorithm is novel in that it uses an approximation based on maxnorm, a technique that more directly minimizes the terms that appear in error bounds for approximate MDP algorithms. We provide experimental results on problems
Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling
, 1999
"... This paper describes an algorithm designed to minimally recongure schedules in response to a changing environment. External factors have caused an existing schedule to become invalid, perhaps due to the withdrawal of resources, or because of changes to the set of scheduled activities. The total shi ..."
Abstract

Cited by 87 (14 self)
 Add to MetaCart
programming approaches. The unimodular probing algorithm interleaves constraint programming and linear programming. The linear programming solver handles only a controlled subset of the problem constraints, to guarantee that the values returned are discrete. Using probe backtracking, a complete, repair
Tree decompositions of graphs: Saving memory in dynamic programming
 CTW 2004: CologneTwente Workshop on Graphs and Combinatorial Optimization, Villa Vigoni (CO
, 2004
"... We propose a simple and effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique ” is based on a treelike set covering problem. We substantiate our findings by experimental results. Our strategy has n ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We propose a simple and effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique ” is based on a treelike set covering problem. We substantiate our findings by experimental results. Our strategy has
Dual decomposition for parsing with nonprojective head automata
 In Proc. of EMNLP
, 2010
"... This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of headautomata models to nonprojective structures. The dual decomposition algorithms are simple and efficient, relying on standa ..."
Abstract

Cited by 101 (16 self)
 Add to MetaCart
on standard dynamic programming and minimum spanning tree algorithms. They provably solve an LP relaxation of the nonprojective parsing problem. Empirically the LP relaxation is very often tight: for many languages, exact solutions are achieved on over 98 % of test sentences. The accuracy of our models
Dynamic Training Subset Selection for Supervised Learning in Genetic Programming
 In Yuval Davidor, HansPaul Schwefel, and Reinhard Manner, editors, Parallel Problem Solving from Nature III
, 1994
"... When using the Genetic Programming (GP) Algorithm on a difficult problem with a large set of training data, a large population size is needed and a very large number of functiontree evaluations must be carried out. This paper describes some efforts made to reduce the number of such evaluations by c ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
When using the Genetic Programming (GP) Algorithm on a difficult problem with a large set of training data, a large population size is needed and a very large number of functiontree evaluations must be carried out. This paper describes some efforts made to reduce the number of such evaluations
TreeDecompositions of Small Pathwidth
, 2000
"... Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeo between width and pathwidth of treedecompositions. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeo between width and pathwidth of treedecompositions.
ElasticTree: Saving Energy in Data Center Networks
 IN NSDI
, 2010
"... Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving a network’s ability to scale up and down, as traffic demands ebb and flow. We present ElasticTree, a networkwide power ..."
Abstract

Cited by 106 (4 self)
 Add to MetaCart
manager, which dynamically adjusts the set of active network elements — links and switches — to satisfy changing data center traffic loads. We first compare multiple strategies for finding minimumpower network subsets across a range of traffic patterns. We implement and analyze ElasticTree on a prototype
Results 1  10
of
628