{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:10:09Z","timestamp":1746288609920,"version":"3.40.4"},"reference-count":20,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9781558603776"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/b978-1-55860-377-6.50047-5","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T03:01:00Z","timestamp":1404183660000},"page":"322-330","source":"Crossref","is-referenced-by-count":2,"title":["Learning to Make Rent-to-Buy Decisions with Systems Applications"],"prefix":"10.1016","author":[{"given":"P.","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib1","doi-asserted-by":"crossref","DOI":"10.1145\/76359.76371","article-title":"\u201cLearnability and the Vapnik Chervonenkis Dimension,\u201d","author":"Blumer","year":"1989","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib2","doi-asserted-by":"crossref","unstructured":"K. Curewitz, P. Krishnan, and J. S. Vitter, \u201cPractical Prefetching via Data Compression,\u201d Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (May 1993), 257\u2013266.","DOI":"10.1145\/170035.170077"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib3","unstructured":"F. Douglis, P. Krishnan, and B. Bershad, \u201cAdaptive Disk Spindown Policies for Mobile Computers,\u201d Proceedings of the Second USENIX Symposium on Mobile and Location Independent Computing."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib4","unstructured":"F. Douglis, P. Krishnan, and B. Marsh, \u201cThwarting the Power Hungry Disk,\u201d Proceedings of the 1994 Winter USENIX Conference (January 1994)."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib5","doi-asserted-by":"crossref","unstructured":"P. Greenawalt, \u201cModeling Power Management for Hard Disks,\u201d Proceedings of the Symposium on Modeling and Simulation of Computer Telecommunication Systems (1994).","DOI":"10.1109\/MASCOT.1994.284446"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib6","unstructured":"Hewlett Packard, \u201cKittyhawk HP C3013A\/C3014A Personal Storage Modules Technical Reference Manual,\u201d March 1993, HP Part No. 5961\u20134343."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib7","doi-asserted-by":"crossref","unstructured":"A. R. Karlin, K. Li, M. S. Manasse, and S. Owicki, \u201cEmpirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor,\u201d Proceedings of the 1991 ACM Symposium on Operating System Principles (1991), 41\u201355.","DOI":"10.1145\/121133.286599"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib8","unstructured":"A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki, \u201cCompetitive Randomized Algorithms for Non-Uniform Problems,\u201d Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (1990), 301\u2013309."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib9","doi-asserted-by":"crossref","unstructured":"S. Keshav, C. Lund, S. J. Phillips, N. Reingold, and H. Saran, \u201cAn Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-over- ATM Networks,\u201d Proceedings of INFOCOM '95, to appear.","DOI":"10.1109\/49.464709"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib10","unstructured":"P. Krishnan, \u201cOnline Prediction Algorithms for Databases and Operating Systems,\u201d Brown University Ph.D. thesis, May 1995."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib11","unstructured":"P. Krishnan, P. M. Long, and J. S. Vitter, \u201cAdaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments,\u201d Duke University Technical Report, CS\u20131995\u201308, March, 1995."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib12","unstructured":"P. Krishnan and J. S. Vitter, \u201cOptimal Prediction for Prefetching in the Worst Case,\u201d Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (January 1994), Also appears as Duke University Technical Report CS-1993\u201326."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib13","unstructured":"K. Li, R. Kumpf, P. Horton, and T. Anderson, \u201cA Quantitative Analysis of Disk Drive Power Management in Portable Computers,\u201d Proceedings of the 1994 Winter USENIX (January 1994)."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib14","doi-asserted-by":"crossref","unstructured":"B. Marsh, F. Douglis, and P. Krishnan, \u201cFlash Memory File Caching for Mobile Computers,\u201d Proceedings of the 27th IEEE Hawaii Conference on System Sciences (January 1994).","DOI":"10.1109\/HICSS.1994.323153"},{"year":"1984","series-title":"Convergence of Stochastic Processes","author":"Pollard","key":"10.1016\/B978-1-55860-377-6.50047-5_bib15"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib16","unstructured":"C. Ruemmler and J. Wilkes, \u201cUNIX Disk Access Patterns,\u201d Proceedings of the 1993 Winter USENIX Conference (January 1993), 405\u2013420."},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib17","doi-asserted-by":"crossref","unstructured":"H. Saran and S. Keshav, \u201cAn Empirical Evaluation of Virtual Circuit Holding Times in IP-over- ATM networks,\u201d Proceedings of INFOCOM '94 (June 1994).","DOI":"10.1109\/INFCOM.1994.337577"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib18","doi-asserted-by":"crossref","unstructured":"V. N. Vapnik, \u201cInductive principles of the search for empirical dependences (methods based on weak convergence of probability measures),\u201d Proceedings of the 1989 Workshop on Computational Learning Theory (1989).","DOI":"10.1016\/B978-0-08-094829-4.50004-0"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"\u201cOn the Uniform Convergence of Relative Frequencies of Events to their Probabilities,\u201d","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theoretical Probability and Its Applications"},{"key":"10.1016\/B978-1-55860-377-6.50047-5_bib20","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and P. Krishnan, \u201cOptimal Prefetching via Data Compression,\u201d Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (October 1991), 121\u2013130, Also appears as Brown University Technical Report No. CS\u201391\u201346.","DOI":"10.1109\/SFCS.1991.185360"}],"container-title":["Machine Learning Proceedings 1995"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603776500475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603776500475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T15:43:40Z","timestamp":1746287020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558603776500475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9781558603776"],"references-count":20,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-377-6.50047-5","relation":{},"subject":[],"published":{"date-parts":[[1995]]}}}