Search

30 Nov 2011: It isassumed that a new document arrives to route i at each jump time of a Poissonprocess that has rate parameter νi > 0 and that each such document has an ... Initial numbers and sizes of documents, arrival times of new documents and theirsizes for

15 Sep 2011: The proof in this paper uses a new technique which has been used by Weber (1978) in solving a problem in the assignment of customers to a number of identical parallel ... The usage function is non-decreasing in t. Components fail randomly during use;

15 Sep 2011: Because smoothing leaves y unchanged and the multiplication by 2 dou-bles it, things are just as they should be, because in the new model, c and / willalso double.

19 Sep 2011: Coffman, E. G., Jr. (ed.) (1976), Computer and Job-Shop Schedulin& Theory, John Wiley and Sons, New York. ... Grouchko and R. Crunon (l977), tiathematica1 Hode1s For the Study of the Reliability of Systems, Academic t'ress, New York.

18 Sep 2011: Froco and Applo 5, pp. 231-241. Keilson, J.: 1979, "Markov Chain Models-Rari ty and Exponen tiality", Springer-Verlag, New York. ... Lippman, S.: 1975, Applying 2 new device in the optimization of exponential queueing systems.

15 Sep 2011: this at each new time period bypurchasing an extra amount at price b, the “dynamic” part ofthe contract. ... The nice thing about this last solution is that we need notknow before introducing the new tariff that the third customereven exists.

15 Sep 2011: Bounds are obtained for the expected makespan when the processing time distributions are New Better (Worse) than Used in Expectation. ... t Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027.

15 Sep 2011: Sincesmoothing leaves i unchanged and the multiplication by two doubles it, things are just as theyshould be, since in the new model, c and mi will also double.3 Trac Source

20 Sep 2011: Shor, R.R. Weber, and M. Yannakakis. In Proc. 23 Annual ACM Symposium on Theory of Computing, New Orleans, May 6-8, pages 230-240, 1991.

15 Sep 2011: Lee, Ed. New York: Mace1 Dekker, 1987. G. Chen and J.

15 Sep 2011: How should the costsbe shared? How should the new virtual facility be sharedamong its contributors? ... Rey,A. Simon, C. Fernandez, D. Kant, and K. M. Sephton.Sun grid engine, a new scheduler for EGCEmiddleware.

29 Sep 2011: What we have done is to rewrite theproblem in a new way, in which the risk parameter a enters by way of a changeto the dynamics of the path. ... REFERENCES. Bucklew, J. (1990) Large Deviation Techniques in Decision, Simulation and Estimation.John Wiley,

15 Sep 2011: Other special cases. provide interesting new results. OUTPUT PROCESSES. AMS 1991 SUBJECT CLASSIFICATION: PRIMARY 60K25. ... A significant new result is obtained by supposing that ci has the distribution of the sum of m independent geometric distributions,

15 Sep 2011: 6n/ 2. 5. Conjectures. One tantalizing aspect of the rendezvous problem is that the proofs of even simple results seem to be elusive and require new techniques. ... Addison-Wesley,. New York. Ross, S. M. (1988) A simple proof of instability of a

25 Oct 2011: projectentitled Improving Rural Water and Livelihood Outcomes in India, China, Africa and Brazil.†School of International and Public Affairs, Columbia University, 420 West 118th Street New York, NY.

15 Sep 2011: Clearly our original idea thatit was simply making sure bins were available into which new items would t exactly doesnot suce. ... In Proceedings of the 25th ACM Symposium on the Theoryof Computing, pages 412{421, New York, 1993.

15 Sep 2011: type available; otherwise, it uses the mechanism M to gen-erate new space. ... Proceed-ings of 24th Symposium on Foundation of Computer Science. New York: IEEE Computer So-ciety Press, pp.

15 Sep 2011: Springer-Verlag, New York. GITTINS, J. C. AND JONES, D. M. (1974) A dynamic allocation index for the sequential design of experiments.

15 Sep 2011: The Connection Admission Control is a primaryfunction of that mechanism, which must decide whether or not to accept a new call, based on thecall's trac characteristics and QoS requirements, and

15 Sep 2011: A new connection of type j would be charged at an amount per unittime equal to 0j(s;t). ... P. (1993) A new approach to service provisioning in ATMnetworks. IEEE/ACM Trans.