2526 search results - page 361 / 506 » A New Algorithm for Answer Set Computation |
147
click to vote
LPNMR
2009
Springer
16 years 25 days ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
182
click to vote
FCT
2007
Springer
16 years 13 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
180
click to vote
CRV
2006
IEEE
16 years 10 days ago
2006
IEEE
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
188
click to vote
ISPDC
2006
IEEE
16 years 9 days ago
2006
IEEE
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
147
click to vote
DNA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...