392 search results - page 28 / 79 » Reversal Complexity Revisited |
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
FSTTCS
2004
Springer
14 years 28 days ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
AGP
1997
IEEE
13 years 11 months ago
1997
IEEE
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In thi...
ARCS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...