Results 1  10
of
1,713
Branching Rules for Satisfiability
 Journal of Automated Reasoning
, 1995
"... Recent experience suggests that branching algorithms are among the most attractive for solving propositional satisfiability problems. A key factor in their success is the rule they use to decide on which variable to branch next. We attempt to explain and improve the performance of branching rules wi ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
Recent experience suggests that branching algorithms are among the most attractive for solving propositional satisfiability problems. A key factor in their success is the rule they use to decide on which variable to branch next. We attempt to explain and improve the performance of branching rules
Branching rules revisited
 OPERATIONS RESEARCH LETTERS
, 2004
"... Mixed integer programs are commonly solved with linear programming based branchandbound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called reliability branching of today’s stateoftheart stron ..."
Abstract

Cited by 69 (8 self)
 Add to MetaCart
Mixed integer programs are commonly solved with linear programming based branchandbound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called reliability branching of today’s state
Conformal branching rules and modular invariants
, 1988
"... Using the outer automorphisms of the affine algebra SU(n), we show how the branching rules for the conformal subalgebra SU(pq) I ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Using the outer automorphisms of the affine algebra SU(n), we show how the branching rules for the conformal subalgebra SU(pq) I
Conflictbased selection of branching rules
 In Sixth International Conference on Theory and Application in Satisfiability Testing (SAT2003
, 2003
"... Abstract. We propose an adaptive framework for branching rule selection that is based on a set of branching rules. Each branching rule is attached a preference value that is dynamically adapted with respect to conflict analysis. Thus, our approach brings together two essential features of modern SAT ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We propose an adaptive framework for branching rule selection that is based on a set of branching rules. Each branching rule is attached a preference value that is dynamically adapted with respect to conflict analysis. Thus, our approach brings together two essential features of modern
Branching rules for Specht modules
 J. Algebra
"... Abstract. Let Σn be the symmetric group of degree n, and let F be a field of characteristic distinct from 2. Let Sλ F be the Specht module over FΣn corresponding to the partition λ of n. We find the indecomposable components of the restricted module S λ F ↓Σ n−1 and the induced module S λ F ↑Σ n+1. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. Let Σn be the symmetric group of degree n, and let F be a field of characteristic distinct from 2. Let Sλ F be the Specht module over FΣn corresponding to the partition λ of n. We find the indecomposable components of the restricted module S λ F ↓Σ n−1 and the induced module S λ F ↑Σ n+1. Namely, if b and B are block idempotents of FΣn−1 and FΣn+1 respectively, then the modules S λ F ↓Σ n−1 b and S λ F ↑Σ n+1 B are 0 or indecomposable. We give examples to show that the assumption char F ̸ = 2 cannot be dropped. 1.
How good are branching rules in DPLL?
, 1996
"... The DavisPutnamLogemannLoveland algorithm is one of the most popular algorithms for solving the satisfiability problem. Its efficiency depends on its choice of a branching rule. We construct a sequence of instances of the satisfiability problem that fools a variety of "sensible" branchi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The DavisPutnamLogemannLoveland algorithm is one of the most popular algorithms for solving the satisfiability problem. Its efficiency depends on its choice of a branching rule. We construct a sequence of instances of the satisfiability problem that fools a variety of "
PROOF OF THE MODULAR BRANCHING RULE FOR CYCLOTOMIC HECKE ALGEBRAS
, 2005
"... We prove the modular branching rule of the cyclotomic Hecke algebras. Unlike the other modular branching rules, this rule is the rule by which we can compute the modular branching of given simple module. ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We prove the modular branching rule of the cyclotomic Hecke algebras. Unlike the other modular branching rules, this rule is the rule by which we can compute the modular branching of given simple module.
A modular branching rule for the generalized symmetric groups
 J. Algebra
"... Abstract. We give a modular branching rule for certain wreath products as a generalization of Kleshchev’s modular branching rule for the symmetric groups. Our result contains a modular branching rule for the complex reflection groups G(m, 1, n) (which are often called the generalized symmetric group ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We give a modular branching rule for certain wreath products as a generalization of Kleshchev’s modular branching rule for the symmetric groups. Our result contains a modular branching rule for the complex reflection groups G(m, 1, n) (which are often called the generalized symmetric
Learning to select branching rules in the DPLL procedure for satisfiability
 In LICS/SAT
, 2001
"... The DPLL procedure is the most popular complete satisfiability (SAT) solver. While its worst case complexity is exponential, the actual running time is greatly affected by the ordering of branch variables during the search. Several branching rules have been proposed, but none is the best in all case ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
The DPLL procedure is the most popular complete satisfiability (SAT) solver. While its worst case complexity is exponential, the actual running time is greatly affected by the ordering of branch variables during the search. Several branching rules have been proposed, but none is the best in all
Results 1  10
of
1,713