benchmark 
A twolane PCIgirder bridge was selected as the benchmark model.


Semiactive model predictive control for 3rd generation benchmark problem using smart dampers


Numerical simulation of the nonlinear seismic responses of a controlled 20story benchmark building is carried out, and the simulation results are compared to those of other control systems.


To evaluate the new procedure we perform a rigorous computational study on two benchmark sets.


This paper summarizes the results of a benchmark study focusing on aftersales service logistics systems for technologically complex highvalue products, i.e., in the computer industry.


The algorithm is tested on randomly generated problems, benchmark problems in the literature, and new hard problems generated in this paper.


Moreover, some of the benchmark problems in the literature are solved to optimality for the first time.


We use a Markov Decision Process (MDP) model to compute optimal policies and provide a benchmark for evaluating threshold policy heuristics.


Using this as a benchmark, we then compare the results from the arbitrary model and illustrate the different uses of the two scenario constructs.


In order to quantify the benefits due to advance order information, we investigate the performance of the proposed mechanism and benchmark it against against the optimal control policy.


JCA establishes a theoretical benchmark for performance, but is only achievable when all planning information is public.


Case studies of Zmodule reasoning: Proving benchmark theorems from ring theory


In a case study, the ZMR system designed to implement this method was used to prove the benchmark x3 ring theorem from associative ring theory.


We give a set of 105 benchmark examples and compare execution times for implementations of the two approaches.


The experiment focused on an attemptwhich I knew would failto prove one of the benchmark theorems that had eluded us for years.


It has also been successfully applied to a number of standard benchmark problems in combinational circuit verification.


A Benchmark Method for the Propositional Modal Logics K, KT, S4


We try to improve this unsatisfactory situation by presenting a set of benchmark formulas.


As a starting point we give the results we obtained when we applied this benchmark method to the Logics Workbench (LWB).


We hope that the discussion of postulates concerning ATP benchmark helps to obtain improved benchmark methods for other logics, too.

