Results 1 - 10 of 65,929

Table 1. IT transaction costs by relationship type. Costs have been derived from our previous studies [25, 26] and literature on transaction cost studies [30, 13, 15]

in Requirements Analysis for Socio-technical System Design
by Alistair G. Sutcliffe 2000
"... In PAGE 10: ...uncertain market it may be better to risk doing without the goods. The degree of coupling between organisations is not only influenced by market/supply factors but also by power and resource dependencies [ 14, 16] which can have implications for negotiating contracts and relationships The IT implications associated with each relationship type are shown in Table1 . For market relationships, product databases, sales support systems and broking/matching tools are important; but as relationships become more closely coupled workflow coordination, progress tracking and contract support systems are necessary.... ..."
Cited by 1

Table 1. Experimental [13-15] and Model Permeabilities for Pervious Concretes

in TECHNOLOGY ADMINISTRATION
by Dale P. Bentz, Nicos S. Martys, Dale P. Bentz, Nicos S. Martys, Carlos M. Gutierrez, Robert C. Cresanti, Under Secretary, Commerce Technology, William Jeffrey Director 2007
"... In PAGE 6: ...ext, solving for v2. Grey voxels illustrate solids and white voxels are porosity....... 5 List of Tables Table1... ..."

Table 1: Load Balancing Statistics [18] Shasha D. and Goodman N. Concurrent Search Tree Algorithms, ACM Transactions on Database Systems, 13(1), 1988, pp. 53-90. [19] Weihl E. W. and Wang P. Multi-version Memory: Software cache Management for Concurrent B- Trees, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 650-655. [20] Yen I. and Bastani F. Hash Table in Massively Parallel Systems, Proceedings of the 1992 Interna- tional Conferences on Computer Languages, April 20-23, 1992, pp. 660-664.

in Implementing Distributed Search Structures
by Padmashree Krishna, Theodore Johnson 1992
"... In PAGE 16: ... With hot spots the variation is much greater, indicating the nice e ect load balancing has for smoothing the variation and reducing the gradient. Finally Table1 shows the calculated average number of moves made by a node in the entire system, with and without hot spots and with and without load balancing, and the normalized variation of the capacity at each processor from the mean. The table shows that the load balancing reduces the coe cient of variation at the cost of a very small increase in the average moves in the system, indicating that load balancing is e ective with low overhead.... ..."
Cited by 4

Table 12: Data for ATUM Traces on 32K Caches [3] J. H. Chang, H. Chao, and K. So, \Cache Design of A Sub-Micron CMOS System/370, quot; in Proceedings of the 14th Annual International Symposium on Computer Architecture, Pittsburgh, Pennsylvania, pp. 208{213, IEEE Computer Society and ACM SIGARCH, June 2{5, 1987. Computer Architecture News, 15(2), June 1987. [4] John L. Hennessy and David A. Patterson, Computer Architecture: A Quantitative Ap- proach. Morgan Kaufmann Publishers, Inc., 1990. [5] Mark D. Hill, \A Case for Direct-Mapped Caches, quot; Computer, 21(12):25{40, December 1988.

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1

Table 13: Data for ATUM Traces on 128K Caches [6] Norman P. Jouppi, \Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Bu ers, quot; in Proceedings of the 17th Annual International Symposium on Computer Architecture, Seattle, Washington, pp. 364{373, IEEE Computer Society and ACM SIGARCH, May 28{31, 1990. Computer Architecture News, 18(2), June 1990. [7] S. Przybylski, M. Horowitz, and J. Hennessy, \Performance Tradeo s in Cache Design, quot; in Proceedings of the 15th Annual International Symposium on Computer Architecture, Honolulu, Hawaii, pp. 290{298, IEEE Computer Society and ACM SIGARCH, May 30{ June 2, 1988. Computer Architecture News, 16(2), May 1988. 36

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1

TABLE 1 TABLE 2 NORMAL MECG VALUES [8, 12] NORMAL FECG VALUES [13-15]

in A New Mother Wavelet for Fetal Electrocardiography, to Achieve Optimal Denoising and Compressing Results
by S Almagro

Table 1: Contributions of known resonances to sum rules eqs.(13,15)

in unknown title
by unknown authors

Table 4. Homogamy among Black Residents of Baltimore, Maryland in 1860 Observed / Expected Frequencies by Complexion Combinations

in Some Historical Evidence
by Howard Bodenhorn 2004

Table 3. Particle Properties and Quantum Numbers

in NASA/TP-2002-211957 Exclusive Reactions Involving Pions and
by John W. Norbury, Steve R. Blattnig, R. K. Tripathi 2002

Table 11: Data for ATUM Traces on 8K Caches References [1] Anant Agarwal, John Hennessy, and Mark Horowitz, \Cache Performance of Operating Systems and Multiprogramming, quot; ACM Transactions on Computer Systems, 6(4):393{431, November 1988. [2] Anant Agarwal and Steven D. Pudar, \Column-Associative Caches: A Technique for Re- ducing the Miss Rate of Direct-Mapped Caches, quot; in Proceedings of the 20th Annual Inter- national Symposium on Computer Architecture, San Diego, California, pp. 179{190, ACM SIGARCH and IEEE Computer Society, May 17{19, 1993. Computer Architecture News, 21(2), May 1993.

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1
Results 1 - 10 of 65,929