1 resultado para static random access memory
em Massachusetts Institute of Technology
Filtro por publicador
- Abertay Research Collections - Abertay University’s repository (1)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (7)
- Aston University Research Archive (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (7)
- Boston University Digital Common (2)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (15)
- CentAUR: Central Archive University of Reading - UK (15)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (8)
- Cochin University of Science & Technology (CUSAT), India (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (5)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- Duke University (4)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (2)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (4)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (47)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (5)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (4)
- Massachusetts Institute of Technology (1)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (3)
- Portal de Revistas Científicas Complutenses - Espanha (4)
- Publishing Network for Geoscientific & Environmental Data (33)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (18)
- Queensland University of Technology - ePrints Archive (456)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (3)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (13)
- School of Medicine, Washington University, United States (4)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (9)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (7)
- Universita di Parma (1)
- Universitat de Girona, Spain (1)
- Université de Montréal (1)
- Université de Montréal, Canada (1)
- University of Michigan (180)
- University of Queensland eSpace - Australia (4)
- University of Washington (2)
Resumo:
This article studies the static pricing problem of a network service provider who has a fixed capacity and faces different types of customers (classes). Each type of customers can have its own capacity constraint but it is assumed that all classes have the same resource requirement. The provider must decide a static price for each class. The customer types are characterized by their arrival process, with a price-dependant arrival rate, and the random time they remain in the system. Many real-life situations could fit in this framework, for example an Internet provider or a call center, but originally this problem was thought for a company that sells phone-cards and needs to set the price-per-minute for each destination. Our goal is to characterize the optimal static prices in order to maximize the provider's revenue. We note that the model here presented, with some slight modifications and additional assumptions can be used in those cases when the objective is to maximize social welfare.