Littérature scientifique sur le sujet « Resource allocations problems »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Resource allocations problems ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Resource allocations problems"
Lin, Shan-Shan. « Due-Window Assignment and Resource Allocation Scheduling with Truncated Learning Effect and Position-Dependent Weights ». Discrete Dynamics in Nature and Society 2020 (8 octobre 2020) : 1–7. http://dx.doi.org/10.1155/2020/9260479.
Texte intégralFu, Lei, Junmin Wang, Shiwu Wang, Hongxi Peng et Zihan Gui. « Study of Water Resource Allocation and Optimization Considering Reclaimed Water in a Typical Chinese City ». Sustainability 15, no 1 (2 janvier 2023) : 819. http://dx.doi.org/10.3390/su15010819.
Texte intégralBudish, Eric, Yeon-Koo Che, Fuhito Kojima et Paul Milgrom. « Designing Random Allocation Mechanisms : Theory and Applications ». American Economic Review 103, no 2 (1 avril 2013) : 585–623. http://dx.doi.org/10.1257/aer.103.2.585.
Texte intégralEtor, Comfort R., Ekpenyong E. Ekanem et Mary A. Sule. « Access and Resource Allocation to Education in Nigeria ». International Education Studies 13, no 3 (18 février 2020) : 79. http://dx.doi.org/10.5539/ies.v13n3p79.
Texte intégralTrang, Le Hong, et Hoang Huu Viet. « Optimally stable matchings for resource allocations ». Vietnam Journal of Science and Technology 60, no 2 (21 avril 2022) : 257–69. http://dx.doi.org/10.15625/2525-2518/16107.
Texte intégralGlazebrook, K. D. « Bounds for discounted stochastic scheduling problems ». Journal of Applied Probability 28, no 4 (décembre 1991) : 791–801. http://dx.doi.org/10.2307/3214682.
Texte intégralGlazebrook, K. D. « Bounds for discounted stochastic scheduling problems ». Journal of Applied Probability 28, no 04 (décembre 1991) : 791–801. http://dx.doi.org/10.1017/s0021900200042704.
Texte intégralCigler, Ludek, et Boi Faltings. « Symmetric Subgame Perfect Equilibria in Resource Allocation ». Proceedings of the AAAI Conference on Artificial Intelligence 26, no 1 (20 septembre 2021) : 1326–32. http://dx.doi.org/10.1609/aaai.v26i1.8233.
Texte intégralChen, Ye, Nikola Marković, Ilya O. Ryzhov et Paul Schonfeld. « Data-Driven Robust Resource Allocation with Monotonic Cost Functions ». Operations Research 70, no 1 (janvier 2022) : 73–94. http://dx.doi.org/10.1287/opre.2021.2145.
Texte intégralCigler, L., et B. Faltings. « Symmetric Subgame-Perfect Equilibria in Resource Allocation ». Journal of Artificial Intelligence Research 49 (26 février 2014) : 323–61. http://dx.doi.org/10.1613/jair.4166.
Texte intégralThèses sur le sujet "Resource allocations problems"
Hicks, Dixon Kendall. « Applicability of computer spreadsheet simulation for solving resource allocations problems ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from the National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA267436.
Texte intégralVu, Dong Quan. « Models and solutions of strategic resource allocation problems : approximate equilibrium and online learning in Blotto games ». Electronic Thesis or Diss., Sorbonne université, 2020. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2020SORUS120.pdf.
Texte intégralResource allocation problems are broadly defined as situations involving decisions on distributing a limited budget of resources in order to optimize an objective. In particular, many of them involve interactions between competitive decision-makers which can be well captured by game-theoretic models. In this thesis, we choose to investigate resource allocation games. We primarily focus on the Colonel Blotto game (CB game). In the CB game, two competitive players, each having a fixed budget of resources, simultaneously distribute their resources toward n battlefields. Each player evaluates each battlefield with a certain value. In each battlefield, the player who has the higher allocation wins and gains the corresponding value while the other loses and gains zero. Each player's payoff is her aggregate gains from all the battlefields. First, we model several prominent variants of the CB game and their extensions as one-shot complete-information games and analyze players' strategic behaviors. Our first main contribution is a class of approximate (Nash) equilibria in these games for which we prove that the approximation error can be well-controlled. Second, we model resource allocation games with combinatorial structures as online learning problems to study situations involving sequential plays and incomplete information. We make a connection between these games and online shortest path problems (OSP). Our second main contribution is a set of novel regret-minimization algorithms for generic instances of OSP under several restricted feedback settings that provide significant improvements in regret guarantees and running time in comparison with existing solutions
Muñoz, i. Solà Víctor. « Robustness on resource allocation problems ». Doctoral thesis, Universitat de Girona, 2011. http://hdl.handle.net/10803/7753.
Texte intégralAquesta tesi se centra en l'elaboració de tècniques que consideren la incertesa alhora de cercar solucions robustes, és a dir solucions que puguin continuar essent vàlides encara que hi hagi canvis en l'entorn. Particularment, introduïm el concepte de robustesa basat en reparabilitat, on una solució robusta és una que pot ser reparada fàcilment en cas que hi hagi incidències. La nostra aproximació es basa en lògica proposicional, codificant el problema en una fórmula de satisfactibilitat Booleana, i aplicant tècniques de reformulació per a la generació de solucions robustes. També presentem un mecanisme per a incorporar flexibilitat a les solucions robustes, de manera que es pugui establir fàcilment el grau desitjat entre robustesa i optimalitat de les solucions.
Resource allocation problems usually include uncertainties that can produce changes in the data of the problem. These changes may cause difficulties in the applicability of the solutions.
This thesis is focused in the elaboration of techniques that take into account such uncertainties while searching for robust solutions, i.e. solutions that can remain valid even if there are changes in the environment. Particularly, we introduce the concept of robustness based on reparability, where a robust solution is one that can be easily repaired when unexpected events occur. Our approach is based in propositional logic, encoding the problem to a Boolean formula, and applying reformulation techniques in order to generate robust solutions. Additionally, we present a mechanism to incorporate flexibility to the robust solutions, so that one can easily set the desired degree between optimality and robustness.
Hosein, Patrick Ahamad. « A class of dynamic nonlinear resource allocation problems ». Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14258.
Texte intégralIncludes bibliographical references (leaves 213-214).
by Patrick Ahamad Hosein.
Ph.D.
Lakshmanan, Hariharan 1980. « Resource allocation problems in stochastic sequential decision making ». Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/47736.
Texte intégralIncludes bibliographical references (p. 159-162).
In this thesis, we study resource allocation problems that arise in the context of stochastic sequential decision making problems. The practical utility of optimal algorithms for these problems is limited due to their high computational and storage requirements. Also, an increasing number of applications require a decentralized solution. We develop techniques for approximately solving certain class of resource allocation problems that arise in the context of stochastic sequential decision making problems that are computationally efficient with a focus on decentralized algorithms where appropriate. The first resource allocation problem that we study is a stochastic sequential decision making problem with multiple decision makers (agents) with two main features 1) Partial observability Each agent may not have complete information regarding the system 2) Limited Communication - Each agent may not be able to communicate with all other agents at all times. We formulate a Markov Decision Process (MDP) for this problem. The features of partial observability and limited communication impose additional computational constraints on the exact solution of the MDP. We propose a scheme for approximating the optimal Q function and the optimal value function associated with this MDP as a linear combination of preselected basis functions. We show that the proposed approximation scheme leads to decentralization of the agents' decisions thereby enabling their implementation under limited communication. We propose a linear program, ALP, for selecting the parameters for combining the basis functions. We establish bounds relating the approximation error due to the choice of the parameters selected by the ALP with the best possible error given the choice of basis functions.
(cont.) Motivated by the need for a decentralized solution to the ALP, which is equivalent to a resource allocation problem with separable, concave objective function, we analyze a general class of resource allocation problems with separable concave objective functions. We propose a distributed algorithm for this class of problems when the objective function is differentiable and establish its convergence and convergence rate properties. We develop a smoothing scheme for non-differentiable objective functions and extend the algorithm for this case. Finally, we build on these results to extend the decentralized algorithm to accommodate non-negativity constraints on the resources. Numerical investigations on the performance of the developed algorithm show that our algorithm is competitive with its centralized counterpart. The second resource allocation problem that we study is the problem of optimally accepting or rejecting arriving orders in a Make-To-Order (MTO) manufacturing firm. We model the production facility of the MTO manufacturing firm as a queue and view the time of the production facility as a resource that needs to be optimally allotted between current and future orders. We formulate the Order Acceptance Problem under two arrival processes - Poisson process (OAP-P), and Bernoulli Process (OAP-B) and formulate both problems as MDPs. We provide insights into the structure of the optimal order acceptance policy for OAP-B under the assumption of First Come First Served (FCFS) scheduling of accepted orders.
(cont.) We investigate a class of randomized order acceptance policies for OAP-B called static policies that are practically relevant due to their ease of implementation and develop a procedure for computing the policy gradient for any static policy. Using these results for OAP-B, we propose 4 heuristics for OAP-P. We numerically investigate the performance of the proposed heuristics and compare their performance with other heuristics reported in literature. One of our proposed heuristics, FCFS-ValueFunction outperforms other heuristics under a variety of conditions while also being easy to implement.
by Hariharan Lakshmanan.
Ph.D.
Chen, Gang. « On scheduling and resource allocation problems with uncertainty ». [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0002303.
Texte intégralVemulapalli, Manish Goldie. « Resource allocation problems in communication and control systems ». Diss., University of Iowa, 2012. https://ir.uiowa.edu/etd/3547.
Texte intégralZhu, Zhanguo. « Scheduling problems with consumable resource allocation and learning effect ». Troyes, 2011. http://www.theses.fr/2011TROY0011.
Texte intégralThis thesis addresses scheduling problems with consumable resource allocation and learning effect. In traditional deterministic scheduling problems, job processing times are assumed to be constant. However, this assumption is not always appropriate in many real life production and service operations since practical issues, including limited consumable resources, human characteristics (learning effect), usually affect job processing times, which change the whole scheduling process and lead to new characteristics to decision-making and scheduling results. It is therefore necessary and reasonable to study scheduling problems with these features. Based on the above two issues, this thesis mainly concerns four scheduling problems including group technology, rate-modifying activity (RMA), past-sequence-dependent setup times, and due-windows. It is worth to note that RMA which reflects the situations of ma-chines is also a key factor considered. It is involved in all studied problems except the first one. This thesis is also a work considering comprehensively new characteristics of consumable resources, human, and machines although we just organize this thesis from the viewpoint of consumable resource allocation and learning effect. For each problem, we propose a scheduling model, design an exact algorithm, and analyze the complexity
Zhao, Haiquan. « Measurement and resource allocation problems in data streaming systems ». Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34785.
Texte intégralCelik, Melih. « Resource allocation problems under uncertainty in humanitarian supply chains ». Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52302.
Texte intégralLivres sur le sujet "Resource allocations problems"
Naoki, Katoh, dir. Resource allocation problems : Algorithmic approaches. Cambridge, Mass : MIT Press, 1988.
Trouver le texte intégralWang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?] : [publisher not identified], 2017.
Trouver le texte intégral1948-, Langholtz Harvey J., dir. Resource-allocation behavior. Boston : Kluwer Academic Publishers, 2003.
Trouver le texte intégralMark, Isaac R., et Plott Charles R, dir. The allocation of scarce resources : Experimental economics and the problem of allocating airport slots. Boulder : Westview Press, 1989.
Trouver le texte intégralSalzhanit︠s︡yn, A. I. Sovremennye problemy razvitii︠a︡ materialʹnoĭ bazy otrasleĭ sot︠s︡ialʹnoĭ sfery Rossii. Moskva : Izd-vo OOO "ProfVariant", 2002.
Trouver le texte intégralBuenaventura, Elioth Mirsha Sanabria. On the Misclassification Cost Problem and Dynamic Resource Allocation Models for EMS. [New York, N.Y.?] : [publisher not identified], 2022.
Trouver le texte intégralRahders, Ralf. Verfahren und Probleme der Bestimmung des optimalen Werbebudgets : Eine modellorientierte Analyse unter besonderer Berücksichtigung dynamischer Aspekte und Entscheidungen bei mehrfacher Zielsetzung. Idstein : Schulz-Kirchner, 1989.
Trouver le texte intégralKöckeritz, Antje. Distributing medical resources : An application of cooperative bargaining theory to an allocation problem in medicine. Frankfurt am Main : Peter Lang, 2012.
Trouver le texte intégralUnited, States Congress House Committee on Government Reform Subcommittee on National Security Veterans Affairs and International Relations. VA health care : Structural problems, superficial solutions : hearing before the Subcommittee on National Security, Veterans Affairs, and International Relations of the Committee on Government Reform, House of Representatives, One Hundred Seventh Congress, second session, May 14, 2002. Washington : U.S. G.P.O., 2003.
Trouver le texte intégralAn inquiry into well-being and destitution. Oxford : Clarendon Press, 1993.
Trouver le texte intégralChapitres de livres sur le sujet "Resource allocations problems"
Balicki, J., et Z. Kitowski. « Hopfield’s Artificial Neural Networks In Multiobjective Optimization Problems of Resource Allocations Control ». Dans ROMANSY 11, 355–62. Vienna : Springer Vienna, 1997. http://dx.doi.org/10.1007/978-3-7091-2666-0_41.
Texte intégralKatoh, Naoki, et Toshihide Ibaraki. « Resource Allocation Problems ». Dans Handbook of Combinatorial Optimization, 905–1006. Boston, MA : Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-0303-9_14.
Texte intégralKatoh, Naoki, Akiyoshi Shioura et Toshihide Ibaraki. « Resource Allocation Problems ». Dans Handbook of Combinatorial Optimization, 2897–988. New York, NY : Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-7997-1_44.
Texte intégralYang, Song, Nan He, Fan Li et Xiaoming Fu. « Resource Allocation Problems Formulation and Analysis ». Dans Resource Allocation in Network Function Virtualization, 7–22. Singapore : Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-4815-2_2.
Texte intégralParsaeefard, Saeedeh, Ahmad Reza Sharafat et Nader Mokari. « Nonconvex Robust Problems ». Dans Robust Resource Allocation in Future Wireless Networks, 145–231. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-50389-9_4.
Texte intégralStańczak, Sławomir, Marcin Wiczanowski et Holger Boche. « Chapter 5 : Resource Allocation Problem in Communications Networks ». Dans Resource Allocation in Wireless Networks, 91–128. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11818762_5.
Texte intégralZhang, Donghui, et Yang Du. « Resource Allocation Problems in Spatial Databases ». Dans Encyclopedia of Database Systems, 1–6. New York, NY : Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4899-7993-3_315-2.
Texte intégralZhang, Donghui, et Yang Du. « Resource Allocation Problems in Spatial Databases ». Dans Encyclopedia of Database Systems, 2419–23. Boston, MA : Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_315.
Texte intégralMoulin, Hervé, et William Thomson. « Axiomatic Analysis of Resource Allocation Problems ». Dans Social Choice Re-examined, 101–20. London : Palgrave Macmillan UK, 1997. http://dx.doi.org/10.1007/978-1-349-25849-9_9.
Texte intégralZhang, Donghui, et Yang Du. « Resource Allocation Problems in Spatial Databases ». Dans Encyclopedia of Database Systems, 3216–21. New York, NY : Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_315.
Texte intégralActes de conférences sur le sujet "Resource allocations problems"
Yin, Steven, Shatian Wang, Lingyi Zhang et Christian Kroer. « Dominant Resource Fairness with Meta-Types ». Dans Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California : International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/68.
Texte intégralVu, Dong Quan, Patrick Loiseau et Alonso Silva. « Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/72.
Texte intégralSadok, Hugo, Miguel Elias Mitre Campista et Luis Henrique Maciel Kosmalski Costa. « Improving Software Middleboxes and Datacenter Task Schedulers ». Dans XXXVII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbrc_estendido.2019.7780.
Texte intégralSadok, Hugo, Miguel Elias M. Campista et Luis Henrique M. K. Costa. « Improving Software Middleboxes and Datacenter Task Schedulers ». Dans XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6334.
Texte intégralYuen, Sheung Man, et Warut Suksompong. « Approximate Envy-Freeness in Graphical Cake Cutting ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/326.
Texte intégralKyropoulou, Maria, Warut Suksompong et Alexandros A. Voudouris. « Almost Envy-Freeness in Group Resource Allocation ». Dans Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California : International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/57.
Texte intégralS. Sankar, Govind, Anand Louis, Meghana Nasre et Prajakta Nimbhorkar. « Matchings with Group Fairness Constraints : Online and Offline Algorithms ». Dans Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California : International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/53.
Texte intégralImran, Faisal, Khuram Shahzad, Aurangzeab Aurangzeab Butt et Jussi Kantola. « Structural challenges to adopt digital transformation in industrial organizations : A multiple case study ». Dans 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1002231.
Texte intégralBott, Terry F., et Stephen W. Eisenhawer. « A Structured Approach to Resource Allocation ». Dans ASME/JSME 2004 Pressure Vessels and Piping Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/pvp2004-2998.
Texte intégralBiswas, Arpita, et Siddharth Barman. « Fair Division Under Cardinality Constraints ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/13.
Texte intégralRapports d'organisations sur le sujet "Resource allocations problems"
Hero, Alfred, et Demosthenis Teneketzis. Detection and resource Allocation Problems in ATR Systems. Fort Belvoir, VA : Defense Technical Information Center, mars 2002. http://dx.doi.org/10.21236/ada405534.
Texte intégralPforr, Tobias, Fabian Pape et Steffen Murau. After the Allocation : What Role for the Special Drawing Rights System ? Institute for New Economic Thinking Working Paper Series, mars 2022. http://dx.doi.org/10.36687/inetwp180.
Texte intégralBlair, W. D., et G. A. Watson. Benchmark Problem for Radar Resource Allocation and Tracking Maneuvering Targets in the Presence of ECM. Fort Belvoir, VA : Defense Technical Information Center, septembre 1996. http://dx.doi.org/10.21236/ada286909.
Texte intégralChen, Pan, Mei Ieng Lam, Tong Leong Si et Yu-Tao Xiang. Prevalence of poor sleep quality among the general population in China : a meta-analysis of epidemiological studies. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, avril 2023. http://dx.doi.org/10.37766/inplasy2023.4.0055.
Texte intégralSteiner, Roberto, Alberto Carrasquilla et Alberto Alesina. Decentralization in Colombia. Inter-American Development Bank, septembre 2002. http://dx.doi.org/10.18235/0008531.
Texte intégralIssa, Mohsen, Ali Alawieh et Hussein Daoud. Concrete Bridge Deck Crack Sealing. Illinois Center for Transportation, mars 2024. http://dx.doi.org/10.36501/0197-9191/24-007.
Texte intégralVargas, Fernando, Alejandro Rasteletti et Gustavo Crespi. Productivity in Services in Latin America and the Caribbean. Inter-American Development Bank, avril 2014. http://dx.doi.org/10.18235/0006983.
Texte intégralCorrales, Maria Elena, et Lourdes Alvarez. IDB-9 : Evaluation of IDB-9 Commitments for Haiti. Inter-American Development Bank, mars 2013. http://dx.doi.org/10.18235/0010521.
Texte intégralKomba, Aneth, et Richard Shukia. An Analysis of the Basic Education Curriculum in Tanzania : The Integration, Scope, and Sequence of 21st Century Skills. Research on Improving Systems of Education (RISE), février 2023. http://dx.doi.org/10.35489/bsg-rise-wp_2023/129.
Texte intégralKavalsky, Basil, Jose Ignacio Sembler, Monika Huppi et Diether Beuermann. IDB-9 : Knowledge Products. Inter-American Development Bank, mars 2013. http://dx.doi.org/10.18235/0010524.
Texte intégral