Sciweavers

293 search results - page 6 / 59
» Computing Stable Models by Using the ATMS
Sort
View
ICLP
2003
Springer
14 years 1 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
JUCS
2002
116views more  JUCS 2002»
13 years 8 months ago
Bounded Flooding Routing Algorithm for Provisioning the Globally Optimal Route in a Hierarchical ATM Network
: ATM virtual path (VP) contains bundles of virtual channels (VCs). A VP layer network can be used as a server layer network of VC layer networks and each VC layer network can be a...
Daniel Won-Kyu Hong, Choong Seon Hong, Dong-Sik Yu...
SIGGRAPH
2010
ACM
14 years 1 months ago
Stable spaces for real-time clothing
We present a technique for learning clothing models that enables the simultaneous animation of thousands of detailed garments in real-time. This surprisingly simple conditional mo...
Edilson de Aguiar, Leonid Sigal, Adrien Treuille, ...
ICPR
2004
IEEE
14 years 9 months ago
Data Dependent Classifier Fusion for Construction of Stable Effective Algorithms
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...
Dmitry Kropotov, Dmitry Vetrov
LPNMR
2007
Springer
14 years 2 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla