### Table 2. Further, we describe the e ects of a service failure and a search concurrent to a bulkload-process. 3.1 Cost of Optimal Distribution With m gt; 1 components, a distribution of the extraction tasks is optimal if each component must extract features for the same amount of time. Consequently, the minimum cost for the preprocessing step of a bulkload-process is:

1999

"... In PAGE 7: ...2 days 16.2 days (+10 minutes) Table2 : A summary of the measurements with our prototype system. With the gures of our image database and a typical setting of T = 10 minutes, the cost of the preprocessing with our CoMid is almost optimal, i.... In PAGE 7: ... Only when a high-priority task of a search process was issued to a failed service, one could notice a delay. Summary: Table2 summarizes the measurements with our prototype system consisting of m = 7 feature services. The upper table lists the optimal and measured times for a similarity search with an image in the database and a new image as a function of the feature type (cheapest vs.... ..."

Cited by 1

### Table 2: Concurrent Search Algorithm

### Table 4 Classification results with different reducts 1: Number of rules; 2: Classification accuracy POSAR CEAR DISMAR GAAR PSORSAR

"... In PAGE 25: ... So, all the particles have a powerful search capability, which can help the swarm avoid dead ends. The comparison of the number of decision rules and the classification accuracy with different reducts are shown in Table4... ..."

### Table 1. Comparisons of results over ten seeds

1998

"... In PAGE 6: ... The 600,000 value was appropriate for the larger Armour and Buffa problem while the smaller Bazaraa problem converged in much fewer number of solutions searched. Objective function values from the perimeter metric are in Table1 , where the best, median, worst and standard deviation over ten random seeds are shown. The twenty department Armour and Buffa (A amp;B) problem was studied with maximum aspect ratios of 10, 7, 5, 4, 3 and 2, which represent problems ranging from lightly constrained to extremely constrained.... ..."

Cited by 3

### Table 1. Classification of global optimization methods based on the degree of history dependence.

"... In PAGE 2: ... Finally, the small energy difference between the correct and incorrect minima and the exponential growth of the density of the non-native states with energy impose strict requirements on the accuracy of energy evaluation (less than about 1 kcal/mol)5. Numerous approaches have been used to attack the global optimization problem in protein structure prediction, with some success1-8 ( Table1 ). These methods are initially classified according to whether they are deterministic or not; stochastic methods are further subdivided according to the degree of similarity between conformations generated in consecutive iterations of the search algorithm.... In PAGE 3: ... Most of the MC-like stochastic global optimization strategies employ a three-step iteration: (i) modify the current conformation by means of a random move; (ii) evaluate its energy; (iii) accept or reject the new conformation according to an acceptance criterion. The random moves can be ranked by magnitude of change with respect to the current conformation ( Table1 ). The first group contains algorithms in which the generated conformations do not depend on the previous ones.... ..."

### Table 1. Performance Characteristics of Different AM Implementations

1997

"... In PAGE 7: ...ficient, buffered writes in the SCI DSM only. Performance measurements on the UCSB SCI cluster show competitive performance behavior of the SCI AM system ( Table1 ). Our own implementation, depicted in the first row of Table 1, adds little over- head to the raw latency of 9.... ..."

Cited by 13

### Table 1. Comparison of results for various approaches.

"... In PAGE 8: ... 4. Numerical Results Table1 compares the balance and uniformity (t,s) of (n,2) de Bruijn sequences... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. ------------------------- Table1 goes here ------------------------- In Table 1, we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. -------------------------Table 1 goes here ------------------------- In Table1 , we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... ..."

### Table 3b. Solution Statistics for Model 2 (Minimization)

1999

"... In PAGE 4: ...6 Table 2. Problem Statistics Model 1 Model 2 Pt Rows Cols 0/1 Vars Rows Cols 0/1 Vars 1 4398 4568 4568 4398 4568 170 2 4546 4738 4738 4546 4738 192 3 3030 3128 3128 3030 3128 98 4 2774 2921 2921 2774 2921 147 5 5732 5957 5957 5732 5957 225 6 5728 5978 5978 5728 5978 250 7 2538 2658 2658 2538 2658 120 8 3506 3695 3695 3506 3695 189 9 2616 2777 2777 2616 2777 161 10 1680 1758 1758 1680 1758 78 11 5628 5848 5848 5628 5848 220 12 3484 3644 3644 3484 3644 160 13 3700 3833 3833 3700 3833 133 14 4220 4436 4436 4220 4436 216 15 2234 2330 2330 2234 2330 96 16 3823 3949 3949 3823 3949 126 17 4222 4362 4362 4222 4362 140 18 2612 2747 2747 2612 2747 135 19 2400 2484 2484 2400 2484 84 20 2298 2406 2406 2298 2406 108 Table3 a. Solution Statistics for Model 1 (Maximization) Pt Initial First Heuristic Best Best LP Obj.... In PAGE 5: ...) list the elapsed time when the heuristic procedure is first called and the objective value corresponding to the feasible integer solution returned by the heuristic. For Table3 a, the columns Best LP Obj. and Best IP Obj.... In PAGE 5: ... report, respectively, the LP objective bound corresponding to the best node in the remaining branch-and-bound tree and the incumbent objective value corresponding to the best integer feasible solution upon termination of the solution process (10,000 CPU seconds). In Table3 b, the columns Optimal IP Obj., bb nodes, and Elapsed Time report, respectively, the optimal IP objective value, the total number of branch-and-bound tree nodes solved, and the total elapsed time for the solution process.... ..."

### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 3: Solution to the maximum-concurrent flow problem.

2003

"... In PAGE 7: ... There are six commodities in total. By solving the corresponding maximum-concurrent flow problem, we obtain the optimal value for f to be 5 and the flow placement as shown in Table3 . For each commodity, 5 units of ... ..."

Cited by 4