• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 588
Next 10 →

Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

by Radu Marinescu, et al.
"... AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. Since th ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
the variable selection can have a dramatic impact on search performance when solving optimization tasks, we introduce in this paper a new dynamic AND/OR Branchand-Bound algorithmic framework which accommodates variable ordering heuristics. The efficiency of the dynamic AND/OR approach is demonstrated

AND/OR branch-and-bound search for combinatorial optimization in graphical models

by Radu Marinescu, Rina Dechter , 2008
"... We introduce a new generation of depth-first Branch-and-Bound algorithms that explore the AND/OR search tree using static and dynamic variable orderings for solving general constraint optimization problems. The virtue of the AND/OR representation of the search space is that its size may be far small ..."
Abstract - Cited by 39 (19 self) - Add to MetaCart
We introduce a new generation of depth-first Branch-and-Bound algorithms that explore the AND/OR search tree using static and dynamic variable orderings for solving general constraint optimization problems. The virtue of the AND/OR representation of the search space is that its size may be far

And/or branch-and-bound search for pure 0/1 integer linear programming problems

by Radu Marinescu, Rina Dechter - IN CPAIOR 152–166 , 2006
"... AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. In this ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
. In this paper we extend the recently introduced AND/OR Branch-and-Bound algorithm (AOBB) [1] for solving pure 0/1 Integer Linear Programs [2]. Since the variable selection can have a dramatic impact on search performance, we introduce a new dynamic AND/OR Branch-and-Bound algorithm able to accommodate variable

Best-first and/or search for graphical models

by Radu Marinescu , Rina Dechter - In AAAI , 2007
"... Abstract The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to the structure of the graphical model, which can translate into significant time savings. Indeed, in recent years ..."
Abstract - Cited by 17 (6 self) - Add to MetaCart
years depth-first AND/OR Branch-and-Bound algorithms were shown to be very effective when exploring such search spaces, especially when using caching. Since best-first strategies are known to be superior to depth-first when memory is utilized, exploring the best-first control strategy is called for

The Volcano optimizer generator: Extensibility and efficient search

by Goetz Graefe - ICDE , 1993
"... Emerging database application domains demand not only new functionality but also high performance. To satisfy these two requirements, the Volcano project provides efficient, extensible tools for query and request processing, particularly for object-oriented and scientific database systems. One of th ..."
Abstract - Cited by 200 (1 self) - Add to MetaCart
effective support for non-trivial cost models and for physical properties such as sort order. At the same time, it is much more efficient as it combines dynamic programming, which until now had been used only for relational select-project-join optimization, with goal-directed search and branch-and-bound

Source-side Preordering for Translation using Logistic Regression and Depth-first Branch-and-Bound Search∗

by Laura Jehl, Adria Gispert, Mark Hopkins, William Byrne
"... We present a simple preordering approach for machine translation based on a feature-rich logistic regression model to predict whether two children of the same node in the source-side parse tree should be swapped or not. Given the pair-wise chil-dren regression scores we conduct an effi-cient depth-f ..."
Abstract - Add to MetaCart
-first branch-and-bound search through the space of possible children per-mutations, avoiding using a cascade of classifiers or limiting the list of possi-ble ordering outcomes. We report exper-iments in translating English to Japanese and Korean, demonstrating superior per-formance as (a) the number

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems

by Radu Marinescu , 2005
"... AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. In this ..."
Abstract - Add to MetaCart
. In this paper we extend the recently introduced AND/OR Branch-and-Bound algorithm [1] for solving 0/1 Mixed Integer Linear Programming problems. We propose a static version based on pseudo-trees, as well as a dynamic one based on hypergraph separators. Preliminary evaluation on problem instances from MIPLIB2003

Winning the PASCAL 2011 MAP Challenge with Enhanced AND/OR Branch-and-Bound

by Lars Otten, Alexander Ihler, Kalev Kask, Rina Dechter
"... This paper describes our entry for the MAP/MPE track of the PASCAL 2011 Probabilistic Inference Challenge, which placed first in all three time limit categories, 20 seconds, 20 minutes, and 1 hour. Our baseline is a branch-and-bound algorithm that explores the context-minimal AND/OR search graph of ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
This paper describes our entry for the MAP/MPE track of the PASCAL 2011 Probabilistic Inference Challenge, which placed first in all three time limit categories, 20 seconds, 20 minutes, and 1 hour. Our baseline is a branch-and-bound algorithm that explores the context-minimal AND/OR search graph

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems

by unknown authors
"... Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. ..."
Abstract - Add to MetaCart
. In this paper we extend the recently introduced AND/OR Branch-and-Bound algorithm [1] for solving 0/1 Mixed Integer Linear Programming problems. We propose a static version based on pseudo-trees, as well as a dynamic one based on hypergraph separators. Preliminary evaluation on problem instances from MIPLIB2003

Towards Parallel Search for Optimization in Graphical Models

by Lars Otten, Rina Dechter
"... We introduce a strategy for parallelizing a state-of-the-art sequential search algorithm for optimization on a grid of computers. Based on the AND/OR graph search framework, the procedure exploits the structure of the underlying problem graph. Worker nodes concurrently solve subproblems that are gen ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
that are generated by a single master process. Subproblem generation is itself embedded into an AND/OR Branch and Bound algorithm and dynamically takes previous subproblem solutions into account. Drawing upon the underlying graph structure, we provide some theoretical analysis of the parallelization parameters. A
Next 10 →
Results 1 - 10 of 588
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University