1888 search results - page 43 / 378 » Proof theory and computational analysis |
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
FOGA
2011
12 years 11 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
ISORC
2005
IEEE
14 years 29 days ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
ACTA
2006
13 years 7 months ago
2006
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
ICNP
1998
IEEE
13 years 11 months ago
1998
IEEE
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequen...