Search
Search Funnelback University
- Refined by:
- Date: 2011
1 -
50 of
84
search results for news |u:www.statslab.cam.ac.uk
Fully-matching results
-
Time Series
https://www.statslab.cam.ac.uk/~rrw1/timeseries/index.html23 Nov 2011: Good general introduction, especially for those completely new to time series. -
Books
https://www.statslab.cam.ac.uk/~rrw1/books.html31 Oct 2011: Since then there has been a remarkable flowering of new insights, generalizations and applications, to which Glazebrook and Weber have made major contributions. ... This new edition will be an important resource for others wishing to use this approach. -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c01a.html20 Sep 2011: new variants. ... Algorithm SS also depends on a new linear-programming-based pseudopolynomial-time algorithm for solving the NP-hard problem of determining, given a discrete distribution F, just what is the growth -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c99c.html20 Sep 2011: Abstract. This paper reports on experiments with a new on-line heuristic for one-dimensional bin packing whose average-case behavior is surprisingly robust. ... It is known from [7] that for any such distribution the optimal expected waste grows either -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/w82b.html20 Sep 2011: This new approach is based on the notion of sequential open-loop control, sometimes used in control engineering to solve stochastic control problems by deterministic means, and is not base don -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c95b.html20 Sep 2011: Each switch estimates the additional fraction of cells that would be lost if new calls were routed through the switch. -
21 Paper 3, Section I 9H Markov ChainsLet (Xn)n>0 ...
https://www.statslab.cam.ac.uk/~rrw1/markov/MarkovChainTriposQuestions2001-11.pdf29 Sep 2011: Define a new transition matrix P̃ by. P̃ij ={. 0 if i = j,(1 Pii)1Pij if i 6= j. -
Symmetric Rearrangements Around Infinity with Applications to Lévy…
https://www.statslab.cam.ac.uk/~ps422/LevyRearrangement.pdf25 Oct 2011: 1.6] gave a new. proof of this fact. More precisely, they proved (1.5) where (Vi)i0 were taken to be indicator func-. ... rearrangements of the convolution kernels (pi)i1. Instead, we will develop a new approach to prove. -
J. Appl. Prob. 16, 690-695 (1979) Printed in Israel ...
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201979%20The%20interchangeability%20of%20-M-1%20queues%20in%20series.pdf15 Sep 2011: Generalized Semi-Markov Decision Processes [pp.618-630]. New Results in the Theory of Repeated Orders Queueing Systems [pp.631-640]. ... Corrections: Poisson Mixtures and Quasi-Infinite Divisibility of Distributions [p.696]. Corrections: A New Look at -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/w88a.html20 Sep 2011: Springer-Verlag, New York, 1988. Abstract. We consider a scheduling problem in which $n$ jobs are to be scheduled on $m$ identical processors which operate in parallel. -
cam-report-final formatted
https://www.statslab.cam.ac.uk/~grg/papers/cam-report-final2.pdf9 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. -
O.dvi
https://www.statslab.cam.ac.uk/~rrw1/opt1998/O.pdf9 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,. -
bomber12.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/weber-bomber_paper_draft4.pdf21 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. -
Global uniform risk bounds for wavelet deconvolution estimators
https://www.statslab.cam.ac.uk/~nickl/Site/__files/AOS836.pdf17 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]. -
Optimal Search for a Randomly Moving Object
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201986%20Optimal%20search%20for%20a%20randomly%20moving%20object.pdf15 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. -
SEQUENTIAL OPEN-LOOP SCHEDULING STRATEGIES P. Nash, R.R. Weber…
https://www.statslab.cam.ac.uk/~rrw1/publications/Nash%20-%20Weber%201982%20Sequential%20open-loop%20scheduling%20strategies.pdf18 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. -
Top (2007) 15: 211–216DOI 10.1007/s11750-007-0029-9 D I S C ...
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%202007%20Comments%20on%20Dynamic%20priority%20allocation%20via%20restless%20bandit.pdf15 Sep 2011: His paper has inspired me to contributesome new results, which I will report in three parts. -
On the Marginal Benefit of Adding Servers to G/GI/m Queues
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201980%20On%20the%20marginal%20benefit%20of%20adding%20servers%20to%20G%20GI%20m%20queues.pdf15 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. -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c96a.html20 Sep 2011: The O(n{2=3}) upper bound for the continuous model is new and solves a problem posed a decade ago. -
The Move-to-Front Rule for Multiple Lists
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20The%20move-to-front%20rule%20for%20multiple%20lists.pdf15 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. -
State space collapse and diffusion approximation for a network…
https://www.statslab.cam.ac.uk/~frank/PAPERS/AAP591.pdf30 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 -
An Optimal Strategy in Multi-Server Stochastic Scheduling
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Nash%201978%20An%20optimal%20strategy%20in%20multi-server%20stochastic%20scheduling.pdf15 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; -
Effective Bandwidths for Stationary Sources
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201995%20Effective%20bandwidths%20for%20stationary%20sources.pdf15 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. -
" SCHEDULING STOCHASTIC JOIlS ON PARALLEL MACHINES TO HINHIIZE…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201982%20Scheduling%20stochastic%20jobs%20on%20parallel%20machines%20to%20minimize%20makespan%20or%20flowtime.pdf19 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. -
DOMINANT STRATEGIES IN STOCHASTIC ALLOCATION AND SCHEDULING PROBLEMS…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Nash%201982%20Dominant%20strategies%20in%20stochastic%20allocation%20and%20scheduling%20problems.pdf18 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. -
1 Pricing Resources on DemandCostas Courcoubetis∗, Sergios Soursos∗…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Soursos%20-%20Weber%202006%20Pricing%20resources%20on%20demand.pdf15 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. -
Inequalities and Bounds in Stochastic Shop Scheduling
https://www.statslab.cam.ac.uk/~rrw1/publications/Pinedo%20-%20Weber%201984%20Inequalities%20and%20bounds%20in%20stochastic%20shop%20scheduling.pdf15 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. -
On the Performance of an E�ective Bandwidths FormulaCostas…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-Weber%201994%20On%20the%20performance%20of%20an%20effective%20bandwidths%20formula.pdf15 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 -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c91a.html20 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. -
On a conjecture about assigning jobs to processors of differing…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201993%20On%20a%20conjecture%20about%20assigning%20jobs%20to%20processors%20of%20different%20speeds.pdf15 Sep 2011: Lee, Ed. New York: Mace1 Dekker, 1987. G. Chen and J. -
visa06f-courcoubetis.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202009%20Economic%20issues%20in%20shared%20infrastructures.pdf15 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. -
CHAPTER 11 Large Deviation and FluidApproximations in Controlof…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201994%20Large%20deviations%20and%20fluid%20approximations%20in%20control%20of%20stochastic%20systems.pdf29 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, -
The Interchangeability of Tandem Queues with Heterogeneous Customers…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201992%20The%20interchangeability%20of%20tandem%20queues%20with%20heterogeneous%20customers%20and%20dependent%20service%20times.pdf15 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, -
The Rendezvous Problem on Discrete Locations
https://www.statslab.cam.ac.uk/~rrw1/publications/Anderson%20-%20Weber%201990%20The%20rendezvous%20problem%20on%20discrete%20locations.pdf15 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 -
Concavity and Monotonicity Properties in aGroundwater Management…
https://www.statslab.cam.ac.uk/~rrw1/publications/Huh%20-%20Krishnamurhty-%20Weber%202011%20Concavity%20and%20Monotonicity%20Properties%20in%20a%20Groundwater%20Management%20Model.pdf25 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. -
A Self-Organizing Bin Packing HeuristicJanos Csirik � David S. ...
https://www.statslab.cam.ac.uk/~rrw1/publications/Csirik%20-%20Johnson%20-%20Kenyon%20-%20Shor%20-%20Weber%201999%20A%20self-organizing%20bin%20packing%20heuristic.pdf15 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. -
Stability of On-Line Bin Packing with Random Arrivals and…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20Stability%20of%20on-line%20bin%20packing%20with%20random%20arrivals%20and%20long-run%20average%20constraints.pdf15 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. -
On an Index Policy for Restless Bandits
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Weiss%201990%20On%20an%20index%20policy%20for%20restless%20bandits.pdf15 Sep 2011: Springer-Verlag, New York. GITTINS, J. C. AND JONES, D. M. (1974) A dynamic allocation index for the sequential design of experiments. -
An on-line Estimation Procedure forCell-Loss Probabilities in ATM…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-%20Weber%201995%20A%20on-line%20estimation%20procedure%20for%20cell-loss%20probabilities.pdf15 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 -
bc98_crc_with_ref.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Siris%20-%20Weber%201998%20A%20Study%20of%20simple%20usage-based%20charging%20schemes%20for%20broadband%20networks.pdf15 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. -
STOCHASTIC SCHEDULING ON PARALLEL PROCESSORS AND MINIMIZATION OF…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201988%20Stochastic%20scheduling%20on%20parallel%20processors%20and%20minimization%20of%20concave%20functions%20of%20completion%20times.pdf16 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. -
Admission control and routing in ATM networks using inferences from…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kesidis%20-%20Ridder%20-%20Walrand%20-Weber%201995%20Admission%20control%20and%20routing%20in%20ATM%20networks%20using%20inferences%20from%20measured%20buffer%20occupancy.pdf15 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. -
Optimization IB1998
https://www.statslab.cam.ac.uk/~rrw1/opt/index98.html31 Oct 2011: Each lecture begins on a new page. There are individual files for each lecture. -
CHAPTER 13 MONOTONE OPTIMAL POLICIES FOR LEFT-SKIP-FREE MARKOV…
https://www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201999%20Monotone%20optimal%20policies%20for%20left-skip-free%20Markov%20decision%20processes.pdf18 Sep 2011: Chapnlan-l-laIL London, 1995. [5] Lippman, S. A. Applying a new device in the optitnization of exponential queuing systetl1s. -
Stochastic Dispatching of Multi-Priority Jobs to Heterogeneous…
https://www.statslab.cam.ac.uk/~rrw1/publications/Xu%20-%20Mirchandani%20-%20Kumar%20-%20Weber%201990%20Stochastic%20dispatching%20of%20multi-priority%20jobs%20to%20heterogeneous%20processors.pdf15 Sep 2011: Wiley, New York. WEBER, R. R. (1981) Scheduling jobs on parallel machines to minimize makespan or flowtime. -
p2pw6.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Antoniadis%20-%20Courcoubetis%20-%20Weber%202004%20An%20Asymptotically%20Optimal%20Scheme%20for%20P2P%20File%20Sharing.pdf15 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 -
Stable policies for Petri-nets with fluctuating transition processes…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-Weber%201990%20Stable%20policies%20for%20Petri-nets%20with%20fluctuating%20transition%20processes.pdf15 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 -
Necessary and Sufficient Conditions for Stability of a Bin-Packing…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201986%20Necessary%20and%20sufficient%20conditions%20for%20stability%20of%20a%20bin-packing%20system.pdf15 Sep 2011: 284, Springer-Verlag, New York. HOFFMANN, U. (1982) A class of simple stochastic online bin-packing algorithms. -
wiopt.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202004%20Asymptotics%20for%20provisioning%20problems%20of%20peering%20wireless%20LANS%20with%20a%20large%20number%20of%20participants.pdf15 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, -
Z:/helmut/Projekte/JUCS_2008/accepted_papers/Soursos/source_files/sour…
https://www.statslab.cam.ac.uk/~rrw1/publications/Souros%20-%20Courcoubetis%20-Weber%202008%20Dynamic%20bandwidth%20pricing%20Provision%20cost%20market%20size%20effective%20bandwidths%20and%20price%20games.pdf15 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.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.