Search results for "resource allocation."
showing 10 items of 138 documents
Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore Game
2012
Published version of an article in the journal: Applied Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/s10489-012-0346-z The two-armed bandit problem is a classical optimization problem where a decision maker sequentially pulls one of two arms attached to a gambling machine, with each pull resulting in a random reward. The reward distributions are unknown, and thus, one must balance between exploiting existing knowledge about the arms, and obtaining new information. Bandit problems are particularly fascinating because a large class of real world problems, including routing, Quality of Service (QoS) control, game playing, and resource allocation, can be solved …
A graph colouring model for assigning a heterogeneous workforce to a given schedule
1996
Abstract We analyze a heterogeneous workforce assignment problem in which the minimum number of workers required to carry out a machine load plan is calculated. The problem is formulated as a restricted vertex colouring problem and a branch and bound algorithm is presented. The special characteristics of the graph to be coloured allow an efficient implementation of the branch and bound. Computational results show that the algorithm can solve problems of 50 activities, 5, 10 and 15 machines and between 2 to 15 different types of workers in just a few seconds.
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization
2017
Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We …
Energy efficient and distributed resource allocation for wireless powered OFDMA multi-cell networks
2017
In this paper, we investigate the energy efficient resource allocation problem for the wireless powered OFDMA multi-cell networks. In the considered system, the users who have data to transmit in the uplink can only be empowered by the wireless power obtained from multiple base stations (BSs) with a large scale of multiple antennas in the downlink. A time division protocol is considered to divide the time of wireless power transfer (WPT) in the downlink and wireless information transfer (WIT) in the uplink into separate time slot. With the objective to improve the energy efficiency (EE) of the system, we propose the antenna selection, time allocation, subcarrier and power allocation schemes…
University Governance and Finance: The Impact of Changes in Resource Allocation on Decision Making Structures
2002
When trying to account for changes that take place over time in the structure of any organisation, social scientists often use a conceptual framework known as resource dependency theory. This theory assumes that organisations survive only if they are able to react to changes that occur in the world around them in order to obtain the resources they need to stay in operation. Since they have the capacity for independent action, organisations are not passively shaped by their environment; they sometimes are also able to influence it.
On Unstructured File Sharing Networks
2007
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple connections on multiple paths so as to accelerate data transfer. We model this interaction with an unstructured file sharing game. Users are players and their strategies are the numbers of sessions on available paths. We consider a general bandwidth sharing framework proposed by Kelly [1] and Mo and Walrand [2], with TCP as a special case. Furthermore, we incorporate the Tit-for-Tat strategy (adopted by BitTorrent [3] networks) into the unstructured file sharing game to model the competition in which a connection can be …
Face Processing on Low-Power Devices
2009
The research on embedded vision-based techniques is considered nowadays as one of the most interesting matters of computer vision. In this work we address the scenario in which a real-time face processing system is needed to monitor people walking through some locations. Some face detection (e.g., Viola-Jones face detector) and face recognition (e.g., eigenfaces) approaches have reached a certain level of maturity, so we focused on the development of such techniques on embedded systems taking into account both hardware and software constraints. Our goal is to detect the presence of some known individuals inside some sensitive areas producing a compact description of the observed people. Cap…
Channel Occupancy-Based Dynamic Spectrum Leasing in Multichannel CRNs: Strategies and Performance Evaluation
2016
Spectrum leasing has been proposed as an effective approach for enabling more flexible spectrum utilization in CRNs. In CRNs, a primary network (PN) which consists of multiple primary users (PUs) can lease part of the licensed spectrum to secondary users (SUs) in exchange for operational benefits. The focus of this study is to investigate how and to what extent the PN allows spectrum leasing in CRNs, considering the QoS requirements of the PN and the secondary network (SN). Correspondingly, we propose two dynamic spectrum leasing strategies, which can improve the QoS performance of SUs while ensuring sufficient remuneration for PUs. In order to dynamically adjust the portion of leased bandw…
Improving big-data automotive applications performance through adaptive resource allocation
2019
In automotive applications, connected vehicles (CVs) can collect various information (external temperature, speed, location, etc.) and send them to a central infrastructure for exploitation in a wide range of applications: Eco-Driving, fleet management, environmental monitoring, etc. Such applications are known to generate a massive volume of data that is processed in real or near real time (i.e., data streams) depending on the target application requirements. To handle this data volume, big data architectures, based on stream computing paradigm, are usually adopted. Within this paradigm, data are continuously processed by a set of operators (elementary operations) instances. Further, a str…
Queue Based Dynamic Charging Resource Allocation and Coordination for Heterogeneous Traffic in an Electrical Vehicle Charging Station
2021
Electric vehicle (EV) fast-charging stations (CSs) with innovative operation management strategies can help to meet the growing EV charging needs. Despite the short charging time associated with th...