Sciweavers

1132 search results - page 103 / 227
» Structural Average Case Complexity
Sort
View
EUROPAR
2005
Springer
14 years 2 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
ICANN
2005
Springer
14 years 2 months ago
Information Visualization for Knowledge Extraction in Neural Networks
In this paper, a user-centred innovative method of knowledge extraction in neural networks is described. This is based on information visualization techniques and tools for artific...
Liz J. Stuart, Davide Marocco, Angelo Cangelosi
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 2 months ago
RF-BIST: Loopback Spectral Signature Analysis
Built-In Self-Test (BIST) becomes important also for more complex structures like complete front-ends. In order to bring down the costs for the test overhead, Spectral Signature A...
Doris Lupea, Udo Pursche, Hans-Joachim Jentschel
PPAM
2001
Springer
14 years 1 months ago
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
Krzysztof Giaro, Marek Kubale, Michal Malafiejski,...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 8 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...