8780 search results - page 1460 / 1756 » On the Feasibility of Consistent Computations |
170
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
189
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
198
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
151
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
182
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...