1688 search results - page 82 / 338 » Implementing Optimizations at Decode Time |
FORMATS
2007
Springer
14 years 2 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
ICNC
2009
Springer
14 years 2 months ago
2009
Springer
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
ISW
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
WCE
2007
13 years 9 months ago
2007
The focus of this paper is the problem of recursive estimation for uncertain multisensor linear discrete-time systems. We herein propose a new suboptimal filtering algorithm. The b...
ATS
2003
IEEE
14 years 1 months ago
2003
IEEE
1 In this paper, we show that the scheduling of tests on the test access mechanism (TAM) is equivalent to independent job scheduling on identical machines and we make use of an exi...