Sciweavers

8780 search results - page 218 / 1756
» On the Feasibility of Consistent Computations
Sort
View
ICIP
2009
IEEE
16 years 8 months ago
Characterizing Elegance Of Curves Computationally For Distinguishing Morrisseau Paintings And The Imitations
Computerized analysis of paintings has recently gained interest. The rapid technological advancements and the expanding interdisciplinary collaboration present us a promising pros...
LFCS
2009
Springer
16 years 1 months ago
The Logic of Proofs as a Foundation for Certifying Mobile Computation
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
Eduardo Bonelli, Federico Feller
APN
2007
Springer
16 years 1 months ago
Petri Nets, Discrete Physics, and Distributed Quantum Computation
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
Samson Abramsky
CAISE
2005
Springer
16 years 24 days ago
Computing the Relevant Instances That May Violate an OCL Constraint
Integrity checking is aimed at efficiently determining whether the state of the information base is consistent after the application of a set of structural events. One possible way...
Jordi Cabot, Ernest Teniente
OOPSLA
2005
Springer
16 years 22 days ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine