• Publications
  • Influence
Neurological dysfunctions in mice expressing different levels of the Q/R site–unedited AMPAR subunit GluR–B
We generated mouse mutants with targeted AMPA receptor (AMPAR) GluR–B subunit alleles, functionally expressed at different levels and deficient in Q/R–site editing. All mutant lines had increasedExpand
  • 230
  • 15
A general scheme for automatic generation of search heuristics from specification dependencies
TLDR
The paper presents and evaluates the power of a new scheme that generates search heuristics mechanically for problems expressed using a set of functions or relations over a finite set of variables. Expand
  • 96
  • 6
  • PDF
Join-Graph Propagation Algorithms
TLDR
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). Expand
  • 48
  • 6
  • PDF
Winning the PASCAL 2011 MAP Challenge with Enhanced AND / OR Branch-and-Bound
This paper describes our entry for the MAP/MPE track of the PA SC L 2011 Probabilistic Inference Challenge, which placed first in al l three time limit categories, 20 seconds, 20 minutes, and 1 hour.Expand
  • 20
  • 6
  • PDF
Stochastic local search for Bayesian network
  • 60
  • 5
Stochastic Local Search for Bayesian Networks
The paper evaluates empirically the suitability of Stochastic Local Search algorithms (SLS) for nding most probable explanations in Bayesian networks. SLS algorithms (e.g., GSAT, WSAT [16]) haveExpand
  • 59
  • 5
  • PDF
Unifying tree decompositions for reasoning in graphical models
TLDR
We introduce a new algorithm, called bucket-tree elimination, that extends Bucket Elimination (BE) to trees, and show that it can provide a speed-up of n over BE for various reasoning tasks. Expand
  • 101
  • 4
  • PDF
Unifying Cluster-Tree Decompositions for Reasoning in Graphical models ∗
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the clique-treeExpand
  • 28
  • 4
  • PDF
New Search Heuristics for Max-CSP
  • K. Kask
  • Mathematics, Computer Science
  • CP
  • 18 September 2000
TLDR
This paper evaluates the power of a new scheme that generates search heuristics from a parameterized approximation scheme called Mini-Bucket elimination that allows controlled trade-off between computation and accuracy. Expand
  • 21
  • 4
  • PDF
GSAT and Local Consistency
TLDR
It has been shown that hill-climbing constraint satisfaction methods like min-conflicts [Minton et al., 1990] and GSAT can outperform complete systematic search methods like backtracking and backjumping on large classes of problems. Expand
  • 42
  • 3
  • PDF