Sciweavers

1578 search results - page 219 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 8 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...
IBERAMIA
2010
Springer
13 years 8 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 8 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
ICIP
2009
IEEE
14 years 10 months ago
Efficient Distance Estimation For Fitting Implicit Quadric Surfaces
This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates t...
Angel D. Sappa, Mohammad Rouhani
IJCAI
1997
13 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter