Results 1 - 10 of 13,582

Table 3. Experiments with cycle-based DD-model for the VHDL

in Cycle-based Simulation with Decision Diagrams
by Raimund Ubar Adam, Adam Morawiec, Jaan Raik 1999
"... In PAGE 5: ...8.0. The improvement in the simulation performance while using DD based approach over event-driven simulators ranges between 3 to 9 times for the faster simulator and 9 to 37 times in the case of the slower simulator for measured benchmarks. The detailed results are presented in the Table3 . All results are in seconds; Ratio is the event-driven simulation time to DD-based simulation time ratio.... ..."
Cited by 6

Table 3.3. Experimental results for cycle-based simulation algorithms

in Hierarchical Test Generation for Digital Circuits Represented by Decision Diagrams
by Jaan Raik

Table 1. Solution times on U Berlin for various cycle bases

in Performance of Algorithms for Periodic Timetable Optimization
by Christian Liebchen, Mark Proksch, Frank H. Wagner 2004
"... In PAGE 13: ... Table1 shows that on our smallest instance, we may use almost every inte- gral cycle basis in formulation (9b). Only if we put the arcs with largest spans into a spanning tree, we really get a signi cantly worse problem formulation.... In PAGE 14: ... Table 2 shows very impressively Table 2. Solution times on U Berlin for formulations (5) and (7) Formulation (5) (5) (5a) (7) (7) (7) Valid inequalities none (10) none none (10) all LP relaxation (%) 0 82:6 87:7 Solution time defaults (s) 181 2155 3329 (28%) (86%) 340 Solution time other (s) 295 146 7190 (22%) (90%) 1538 that neither formulation (5) nor formulation (7) are able to attain a solution behavior which would be competitive to reasonable formulations in terms of integral cycle bases (9b), as they can be found in Table1 . Although after at most 90 minutes an optimal solution has been found with formulation (7) even when no cuts have been added, the lower bound was less than 30% when the memory limit of 512 MB has been reached.... ..."
Cited by 2

Table 2: In uence of cycle bases on running times for timetabling (Berlin Underground)

in Finding Short Integral Cycle Bases for Cyclic Timetabling
by Christian Liebchen 2003
Cited by 11

Table 3: Comparison between deterministic and uncertainty-based optimization results using cycle-based alter- nating anti-optimization for the SMA microgripper problem.

in 6 Ø� World Congresses of Structural and Multidisciplinary Optimization Ê�Ó � � Â�Ò��ÖÓ Å�Ý ÂÙÒ � � �Ö�Þ�Ð Uncertainty-based Design Optimization of Shape Memory Alloy Microgripper using Combined Cycle-based Alternating Anti-optimization and Nested Paralle
by S. P. Gurav, M. Langelaar, F. Van Keulen
"... In PAGE 7: ... 8, the other constraints show similar behavior. The design variable values and the responses of the final designs are also listed in Table3 . The final values of the constraints are all close to 1, indicating constraint activity.... In PAGE 7: ... Note that in the present study, the nominal value has been used for the objective in both cases. The total number of FEAs and wall clock time required for both deterministic and uncertainty-based optimiza- tion are compared in Table3 . In case of uncertainty-based optimization the required FEAs are 30 times that of... ..."

Table 1: In uence of cycle bases on running times for timetabling (hourly served ICE/IC lines)

in Finding Short Integral Cycle Bases for Cyclic Timetabling
by Christian Liebchen 2003
Cited by 11

Table 3: WCET estimations (in cycles). Benchmark Maximum observed (cycles) Base (cycles) Enhanced (cycles)

in Approximation of the worst-case execution time using structural analysis
by Matteo Corti 2004
Cited by 2

Table 3: WCET estimations (in cycles). Benchmark Maximum observed (cycles) Base (cycles) Enhanced (cycles)

in Approximation of the worst-case execution time using structural analysis
by Matteo Corti 2004
Cited by 2

Table 2.1: Sandia 34-m Test Bed VAWT, CYCLES Base Case Input Summary

in Contractor Report
by San Unlimited Release, Clifford H. Lange, Clifford H. Lange 1996
Cited by 1

Table 6: Counts of variable lifetimes and lifetimes over-extended by top-down and bottom-up cycle-based scheduling without resource constraints. The difference between top-down and bottom-up is only because of dependence graphs.

in Effective Instruction Scheduling with Limited Registers
by Gang Chen
"... In PAGE 65: ... So we can count the number of variable lifetimes that are over-extended in each case. Table6 shows the summarized results for each bench- mark. We can see that bottom-up scheduling over-extends fewer variable lifetimes than top-down scheduling.... ..."
Results 1 - 10 of 13,582