402 search results - page 13 / 81 » Automatic Abstraction for Worst-Case Analysis of Discrete Sy... |
FPCA
1989
13 years 11 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
CIVR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper presents a novel method of automatic image semantic annotation. Our approach is based on the Image-Keyword Document Model (IKDM) with image features discretiza...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
Stochastic Flow Models (SFMs) are stochastic ystems that abstract the dynamics of complex discrete event systems involving the control of sharable resources. SFMs have been used to...
SERP
2007
13 years 9 months ago
2007
- Functional testing of software dedicated for hybrid embedded systems should start at the early development phase and requires analysis of discrete and continuous signals, where t...
CAD
2008
Springer
13 years 7 months ago
2008
Springer
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...