Results 1 - 10 of 8,695

Table 6.12: Solving the economic dispatch problem with 12 time intervals using NPSOL.

in Algorithms for Short-Term Production-Planning of Cogeneration Plants
by Erik Dotzauer

Table 3. Per-invocation timing results for SC dispatch

in A General Framework For Inheritance Management and Method Dispatch in Object-Oriented Languages
by Wade Holst, Duane Szafron 1997
"... In PAGE 18: ... Note that since Sun 4 machines have a clock interval of 1/100 seconds, the granularity of the results is 10ms. Table3 shows six histograms for SC dispatch. Each histogram indicates how many invocations of each algorithm fell within a particular millisecond interval.... ..."
Cited by 8

Table 3. Per-invocation timing results for SC dispatch

in A General Framework For Inheritance Management and Method Dispatch in Object-Oriented Languages
by Wade Holst, Duane Szafron 1997
"... In PAGE 18: ... Note that since Sun 4 machines have a clock interval of 1/100 seconds, the granularity of the results is 10ms. Table3 shows six histograms for SC dispatch. Each histogram indicates how many invocations of each algorithm fell within a particular millisecond interval.... ..."
Cited by 8

Table Dispatch : : : : : : : : : : : : : : : : : : : : : : : : 25

in NeuralGraphics: An Artificial Neural Network Simulator Users Information Guide
by Gregory Tarr April, Gregory L. Tarr

Table 1. Overview of dispatch methods

in Message Dispatch on Pipelined Processors
by Karel Driesen, Urs Hölzle, Jan Vitek 1995
"... In PAGE 4: ...hey dynamically update data structures at run-time, i.e., during program execution. Thus, dynamic techniques can exploit run-time information as well as static information. Table1 lists the techniques we studied. Each description of a dispatch technique includes pseudo-code illustrating the run-time dispatch.... ..."
Cited by 25

Table 11 The effect of Dispatching Rules.

in Modeling, Measurement and Evaluation of Sequencing Flexibility in Manufacturing Systems
by Saifallah Benjaafar, Rajesh Ramakrishnan 1996
"... In PAGE 35: ...The results of the simulation are given in Table11 . The flexible scenarios outperform fixed sequencing under all dispatching rules and at all levels of machine utilization.... ..."
Cited by 3

Table 1: Measures Used by Dispatching Policies Dispatch Policy Measure

in Alternative Loading and Dispatching Policies for Furnace . . .
by J. A. Joines, R. R. Barton, David G. Hiscock, Anne L. Moser, Timothy J. Teyner, K. Kang, P. A. Fishwick, Elif Akçali, Reha Uzsoy

Table 1: Completion Dispatcher Concurrency

in Firfan, Harrison,
by Schmidtg Cs Wustl, Irfan Pyarali, Tim Harrison 1997
"... In PAGE 10: ... However, most modern operating sys- tems support some form of asynchronous I/O. In combination A and B from Table1 , the Post-reactive approach to asynchronous I/O is probably the best, assuming you are not waiting on any semaphores or mutexes. If you are, a Call-through implementation may be more responsive.... ..."
Cited by 23

Table A-3. Dispatch timings

in Message Dispatch on Modern Computer Architectures
by Karel Driesen, Urs Hölzle, Jan Vitek 1995
Cited by 8

Table 2: Nodes of the dispatching structure

in Distributed Generic Functions
by Christian Queinnec, Lip Inria-rocquencourt 1997
Cited by 3
Results 1 - 10 of 8,695