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.

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: 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

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: 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: 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: 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.

16 Sep 2011: Consider the new problem vhich is obtained vhen ve decrease Wi to Wi and increase Pi (X i) to Pi( x J in this fashion. ... The total expected. cost in the new problem vill be just )'1/ a tin1es the total expected discounted cost in the original.

15 Sep 2011: Therefore there are two calls of the new type currently using the buffer. ... Large Deviations. Academic Press, New York, NY, 1989. Y.C. Ho and C.

31 Oct 2011: Each lecture begins on a new page. There are individual files for each lecture.

18 Sep 2011: Chapnlan-l-laIL London, 1995. [5] Lippman, S. A. Applying a new device in the optitnization of exponential queuing systetl1s.

15 Sep 2011: Wiley, New York. WEBER, R. R. (1981) Scheduling jobs on parallel machines to minimize makespan or flowtime.

15 Nov 2011: 5. finer asymptotic detail). We are uniquely able to dealwith multiple constraints because of our new method ofestablishing the applicability of Lagrangian methods forthe mechanism design problem, as we explain for

15 Sep 2011: CH2917-3/90/0000-0664$1. OO @ 1990 IEEE 664. Tlie present paper develops some new theory, which for the PN inoclcl allows oiie to make quibe general assumptions about, fluctatioiis of ... We caii associate with each S; a new maii- ufacturiiig mode t h a

15 Sep 2011: 284, Springer-Verlag, New York. HOFFMANN, U. (1982) A class of simple stochastic online bin-packing algorithms.

15 Sep 2011: This greatly reducesthe economic value of many new portable devices, such as PDAs, tablet computers and smart-phonesrunning the IP protocol. ... Cometa and other large WISPs attempt to set up new WLAN APs inhot spots and create their own standards,

15 Sep 2011: New types of contracts emerge(“dynamic contracts”) which allow customers to dynamically adjust their bandwidthdemand. ... The new reaction curve b(a) has three segments, similar to the reaction curveof Section 3.

15 Sep 2011: Academic Press, New York. MUIRHEAD, R. F. (1903) Some methods applicable to identities and inequalities of symmetric. ... W. Fleming and P. L. Lions, pp. 601-609. Springer-Verlag, New York.

15 Sep 2011: mode k for one period, minus the number of new orders for that item which are received (a number that is independent of k). ... d, where the Alks are nonnegative integers. We can as- sociate with each S' a new manufacturing mode that corresponds to

15 Sep 2011: Received 23 October 1985; revision received 21 April 1986. Postal address: AT & T Bell Laboratories Murray Hill, New Jersey 07974, USA. ... While the methods of earlier sections are adequate to handle the new limit, they are in fact unnecessary; the.

15 Sep 2011: References. BERTSEKAS, D. (1976) Dynamic Programming and Stochastic Control. Academic Press, New York. ... Adv. Appl. Prob. 15, 616-637. LIPPMAN, S. (1975) Applying a new device in the optimization of exponential queueing systems.

15 Sep 2011: Besides, new networkingprotocols mitigate traditional quality problems by making iteasier to assign higher priority to real-time traffic. ... III. TRYING ONE GATEWAY AT A TIME. This case occurs if an aggregator hasn’t configured hisproxies to support

15 Sep 2011: A new connection of type j would becharged at an amount per unit time proportional to j(s;t). ... their leaky bucket parameters, and(iii) the network recomputes the values of s;t for the new operating point.

31 Oct 2011: 2. One can also generalize the result by allowing new arms.

15 Sep 2011: 284, Springer Verlag, Wien, New York. [31 Hoffmann, U. (1982) A class of simple stochastic online bin-packing algorithms, Computing 29, 227-239.

15 Sep 2011: on Theory of Computing, Association for Com-puting Machinery, New York, 1991,230-240. ... 11. 12. 13. 14. 15. 16. of Packing and Partitioning, Wiley& Sons, New York, 1991.

15 Sep 2011: Are there interesting classes for which new perfect packing theoremscan provide us with similar general answers? ... H. Freeman, New York, 1979. [14] D. S. Johnson, Near-Optimal Bin Packing Algorithms, Ph.D.

15 Sep 2011: Thisgreatly reduces the economic value of many new portable de-vices, such as PDAs, tablet computers, and smart-phones run-ning the IP protocol. ... Similar properties hold for the more generalcase of. An interesting issue is how stability is affected by

18 Sep 2011: When either P1 or P2 finishes, S, assigns a new job to the processor just finished and then proceeds optimally. ... Minimizing expected makespans on uniform processor systems 201. In a more mathematical vein, it is apparent from the content of this paper

15 Sep 2011: 6, 305-312. VARAIYA, P. P. (1972) Notes on Optimization. Van Nostrand Reinhold, New York.

20 Sep 2011: What. should she do if Q8 is an easy question?The producers of the show are considering a new game in which everything is the same. ... Quoting any theorem necessary to justifyyour answer, show that for a contestant who plays optimally the new game is

31 Oct 2011: New in this paper is our formulation of models for designingoptimal management policies, our analysis that demonstrates theinadequacy of simple sharing policies, and our proposals for somebetter ones. ... It is appropriate whenorganizations may

15 Sep 2011: confidence interval for the estimator requires time of the order of magnitude of tens of minutes, which is impractical since decisions about accepting new traffic in the network must be done

15 Sep 2011: the new bin where it is placed isassigned the lexicographically first configuration that includes an item of the givensize. ... Each time such an item arrives, the new bin is assigned the lexicographicallyfirst configuration that includes items of size i.

11 Mar 2011: 1996) A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York. Fix, E. ... 1974) Differential Topology Prentice-Hall, New Jersey. Hall, P. and Kang, K.-H.

15 Sep 2011: What is new is the description of a general framework for a classof charging schemes that can be based on arbitrarily rened a posterior measurements and apriori information (such as that ... In Section 4 wegive a numerical example, which compares a

15 Sep 2011: where it finds space in a partially full bin or starts a new bin. ... The argument for bins that start. with items smaller than k 1’2 must confront distinctly new.