Sciweavers

1920 search results - page 120 / 384
» The Complexity of the A B C Problem
Sort
View
RTS
2000
143views more  RTS 2000»
15 years 6 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
ICSM
1996
IEEE
15 years 10 months ago
Preprocessors from an Abstract Point of View
It is well known that the extensive use of preprocessors can lead to serious maintenance problems. However, these tools are still heavily used by developers and maintainers to imp...
Jean-Marie Favre
ISCAS
2011
IEEE
261views Hardware» more  ISCAS 2011»
14 years 10 months ago
Optimization of area in digit-serial Multiple Constant Multiplications at gate-level
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
Levent Aksoy, Cristiano Lazzari, Eduardo Costa, Pa...
NOCS
2007
IEEE
16 years 23 days ago
Implementing DSP Algorithms with On-Chip Networks
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
Xiang Wu, Tamer Ragheb, Adnan Aziz, Yehia Massoud
ICCBR
1997
Springer
15 years 10 months ago
A Large Case-Based Reasoner for Legal Cases
In this paper we propose a large case-based reasoner for the legal domain. Analyzing legal texts for indexing purposes makes the implementation of large case bases a complex task. ...
Rosina Weber-Lee, Ricardo Miranda Barcia, Marcio C...