1677 search results - page 138 / 336 » On the Completeness of Quantum Computation Models |
152
click to vote
SMI
2005
IEEE
16 years 3 days ago
2005
IEEE
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
180
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
269
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
182
click to vote
TLCA
2005
Springer
16 years 14 hour ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
158
click to vote
DAC
2003
ACM
15 years 11 months ago
2003
ACM
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...