Sciweavers

4520 search results - page 72 / 904
» Algebraic Techniques for Timed Systems
Sort
View
DFG
1992
Springer
15 years 6 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
135
Voted
SBBD
2004
133views Database» more  SBBD 2004»
15 years 3 months ago
Query Processing in ROSA Data Model
Learning Content Management Systems (LCMS) store and manage e-learning content and play an important role in the development of Distance Learning technology. ROSA (Repository of O...
Fábio Coutinho, Fabio Porto
BIRTHDAY
2007
Springer
15 years 8 months ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
122
Voted
RTSS
2009
IEEE
15 years 8 months ago
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
93
Voted
CHARME
1993
Springer
68views Hardware» more  CHARME 1993»
15 years 6 months ago
Temporal Analysis of Time Bounded Digital Systems
To perform veri cation of digital systems with time bounded delays, it is essential to characterize the space of all possible system behaviors. In this paper, we describe our analy...
Alan R. Martello, Steven P. Levitan