7820 search results - page 191 / 1564 » Formalization of Time and Space |
191
click to vote
HYBRID
1999
Springer
15 years 11 months ago
1999
Springer
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
208
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
191
click to vote
CAV
2008
Springer
15 years 9 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
188
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
159
click to vote
ICCV
1999
IEEE
16 years 9 months ago
1999
IEEE
We introduce a finite difference expansion for closely spaced cameras in projective vision, and use it to derive differential analogues of the finite-displacement projective match...