Search

Search Funnelback University

Search powered by Funnelback
11 - 30 of 84 search results for news |u:www.statslab.cam.ac.uk
  1. Fully-matching results

  2. cam-report-final formatted

    www.statslab.cam.ac.uk/~grg/papers/cam-report-final2.pdf
    9 Mar 2011: which takes account of migration, demographic shifts and the accession of new Member States. ... 7. What happens when a new State accedes to the Union during a legislative.
  3. O.dvi

    www.statslab.cam.ac.uk/~rrw1/opt1998/O.pdf
    9 May 2011: leaves the basis. 3. Pivot on the element aij. (i.e., get the equations into the appropriate formfor the new basic solution.). ... Check that repeating these instructions on the new tableau, by pivoting on a12,.
  4. bomber12.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/weber-bomber_paper_draft4.pdf
    21 Oct 2011: Academic Press, New York. Samuel E (1970)[S] On some problems in operations research. ... The following proof is new. It is for all our models: both fighter and bomber problems.
  5. Global uniform risk bounds for wavelet deconvolution estimators

    www.statslab.cam.ac.uk/~nickl/Site/__files/AOS836.pdf
    17 Feb 2011: To the best of our knowledge, the minimax lower bounds derived in thisarticle are also new. ... We suggest a new approach to nonparametric confidence bands based onRademacher symmetrization, in a similar vein as in recent work of Koltchinskii[29].
  6. Optimal Search for a Randomly Moving Object

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201986%20Optimal%20search%20for%20a%20randomly%20moving%20object.pdf
    15 Sep 2011: W. H. Fleming and L. G. Gorostiza, Lecture Notes in Control and Information Sciences 42, Springer-Verlag, New York, 326-343. ... VARAIYA, P. (1972) Notes on Optimization. Van Nostrand Reinhold, New York.
  7. SEQUENTIAL OPEN-LOOP SCHEDULING STRATEGIES P. Nash, R.R. Weber…

    www.statslab.cam.ac.uk/~rrw1/publications/Nash%20-%20Weber%201982%20Sequential%20open-loop%20scheduling%20strategies.pdf
    18 Sep 2011: This new alloca tion is pu t into effect during the next review period, and so on. ... J. Sys. Sci. 10, pp. 693-700. Aoki, M.,: 1967, "Optimization of Stochastic Systems", Academic Press, New York.
  8. Top (2007) 15: 211–216DOI 10.1007/s11750-007-0029-9 D I S C ...

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%202007%20Comments%20on%20Dynamic%20priority%20allocation%20via%20restless%20bandit.pdf
    15 Sep 2011: His paper has inspired me to contributesome new results, which I will report in three parts.
  9. On the Marginal Benefit of Adding Servers to G/GI/m Queues

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201980%20On%20the%20marginal%20benefit%20of%20adding%20servers%20to%20G%20GI%20m%20queues.pdf
    15 Sep 2011: 151-173. 6. LUCE, R. D. AND RAIFFA, H., Games and Decisions, Wiley, New York, 1957. ... Comments on a Queueing Inequality [pp. 956 - 959]. New Books.
  10. Abstract

    www.statslab.cam.ac.uk/~rrw1/abstracts/c96a.html
    20 Sep 2011: The O(n{2=3}) upper bound for the continuous model is new and solves a problem posed a decade ago.
  11. The Move-to-Front Rule for Multiple Lists

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20The%20move-to-front%20rule%20for%20multiple%20lists.pdf
    15 Sep 2011: Murray Hill, New Jersey 07974. RICHARD R. WEBER. Cambridge University Engineering DepartmentManagement Studies Group. ... The new cost structure is onein which a cost of [1 pj/(pj pj)] is paid whenever / is replaced at the frontof a list which includes j.
  12. State space collapse and diffusion approximation for a network…

    www.statslab.cam.ac.uk/~frank/PAPERS/AAP591.pdf
    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
  13. An Optimal Strategy in Multi-Server Stochastic Scheduling

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Nash%201978%20An%20optimal%20strategy%20in%20multi-server%20stochastic%20scheduling.pdf
    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;
  14. Effective Bandwidths for Stationary Sources

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201995%20Effective%20bandwidths%20for%20stationary%20sources.pdf
    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.
  15. " SCHEDULING STOCHASTIC JOIlS ON PARALLEL MACHINES TO HINHIIZE…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201982%20Scheduling%20stochastic%20jobs%20on%20parallel%20machines%20to%20minimize%20makespan%20or%20flowtime.pdf
    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.
  16. DOMINANT STRATEGIES IN STOCHASTIC ALLOCATION AND SCHEDULING PROBLEMS…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Nash%201982%20Dominant%20strategies%20in%20stochastic%20allocation%20and%20scheduling%20problems.pdf
    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.
  17. 1 Pricing Resources on DemandCostas Courcoubetis∗, Sergios Soursos∗…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Soursos%20-%20Weber%202006%20Pricing%20resources%20on%20demand.pdf
    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.
  18. Inequalities and Bounds in Stochastic Shop Scheduling

    www.statslab.cam.ac.uk/~rrw1/publications/Pinedo%20-%20Weber%201984%20Inequalities%20and%20bounds%20in%20stochastic%20shop%20scheduling.pdf
    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.
  19. Abstract

    www.statslab.cam.ac.uk/~rrw1/abstracts/c91a.html
    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.
  20. On the Performance of an E�ective Bandwidths FormulaCostas…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-Weber%201994%20On%20the%20performance%20of%20an%20effective%20bandwidths%20formula.pdf
    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
  21. On a conjecture about assigning jobs to processors of differing…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201993%20On%20a%20conjecture%20about%20assigning%20jobs%20to%20processors%20of%20different%20speeds.pdf
    15 Sep 2011: Lee, Ed. New York: Mace1 Dekker, 1987. G. Chen and J.

Refine your results

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.