Sciweavers

25 search results - page 1 / 5
» Approximation Algorithms for the Loop Cutset Problem
Sort
View
UAI
1994
13 years 6 months ago
Approximation Algorithms for the Loop Cutset Problem
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
Ann Becker, Dan Geiger
COMPGEOM
2010
ACM
13 years 10 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
13 years 9 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
ICLP
2009
Springer
14 years 5 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
ECML
2006
Springer
13 years 8 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....