Results 11 - 20
of
32,996
Table 10: measured 16 processor speedup for original real-world applications
"... In PAGE 32: ...31 Table10 reflects the results of applying the two algorithms to the three original real-world structures using the task and communication timings which were derived from actual execution time profiles made on a SGS Thompson Transputer system. The superiority of the HMLM/SA algorithm is evident.... ..."
Table 5: Classifier Performance measured as Maximum Risk for several real-world applications.
"... In PAGE 23: ... However, if our criterion is more conservative and our aim is the minimization of the maximum possible risk (not the minimization of the deviation), the traditional minimax classifier represents the best option. It is shown in Table5 where the maximum risk for the different classifiers is reported. Positive values in this table indicate a cost while negative values represent a benefit.... ..."
Table VIII Real World Applications: Genetic Programming Model Specification for S amp;P500 Index Option and Five Equity Options
1998
Cited by 7
Table I. Experimental Results for Three Real-World Real-Time Applications Normalized Energy CPU Time(s)
Table V. False alarms in real-world environment. Application Total System Calls False Alarms
2006
Cited by 17
Table 2: Benchmark results for tracing some real world (non-interactive) applications.
2003
"... In PAGE 3: ... We also benchmarked some standard non- interactive applications which are closer to re- alistic (interactive) applications than the micro- benchmarks. The results of these tests have been summarized in Table2 . When taking a closer look at these numbers one notices that the slowdown for most benchmarks is lower than a factor of 2.... ..."
Cited by 5
Table 4: Classifier Performance evaluated as Maximum Risk Deviation from the optimal classifier for several real-world applications. Class-conditional risk deviations (Ri cii) reported for the minMaxDev classifier.
"... In PAGE 22: ....3.1 CLASSIFIER ROBUSTNESS UNDER COMPLETE UNCERTAINTY We now study how different neural-based classifiers cope with worst-case situations in prior prob- abilities. The maximum deviation from the optimal classifier (see Table4 ) is reported for the pro- posed minMaxDev strategy as well as for other alternative approaches: the one based on the as- sumption of stationary priors (standard) and the common alternative of deriving the classifier from an equally distributed data set (re-balanced). A comparison with the traditional minimax strategy is also provided.... In PAGE 22: ... A comparison with the traditional minimax strategy is also provided. Together with the previously mentioned value (maximum deviation or regret), deviation for the L class-conditional extreme cases (Ri cii) is also reported for the minMaxDev classifier in Table4 . Results allow to verify that this solution is fairly close to the optimal one where deviation is not dependent on priors and thus, class-conditional deviations take the same value.... ..."
Table 1. Test matrices from real-world applications. Some of the matrices are from the parasol test-matrix collection (www.parallab.uib.no/parasol/data.html), some were donated by Ismail Bustany from Barcelona Design, and some were donated by Anders Ekroth from Comsol. The third column specifies whether the matrices are symmetric positive-definite, the fourth their di- mension, and the fifth the number of nonzeros in their lower trian- gle.
"... In PAGE 13: ....1. Test Matrices. We performed our experiments on three sets of symmetric matrices; each set contains both indefinite and positive-definite matrices. The first set, listed in Table1 consists of matrices that arise in real-world applications. This set is quite small, since there are not many matrices in test-matrix collections that are large enough for evaluating the performance of out-of-core codes.... ..."
Table 5.5: Design results for six N = 16 o -lattice target structures. For each structure three sequences are listed together with the corresponding h 2i and h 2 0i: the sequence used to generate the target structure (\target quot;), and the sequences obtained by multisequence design (MS) and E(r0; )-minimization, respectively. minimization method is given a slight advantage as compared to what would have been the case for a real-world application.
Table 1. Call-statistics on a real-world system
in Matrix I
2003
"... In PAGE 11: ... Indexing the database is crucial for good performance. Table1 illus- trates the calling pattern from a real-world application counting 4 million triples. In addition, we know our data is described by figure 7.... ..."
Results 11 - 20
of
32,996