5275 search results - page 817 / 1055 » Computing by observing |
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...
188
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...
160
click to vote
AIIA
2007
Springer
15 years 8 months ago
2007
Springer
Few works are available in the literature to define similarity criteria between First-Order Logic formulæ, where the presence of relations causes various portions of one descript...
178
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
165
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...