نتایج جستجو برای: optimal joint scheduling

تعداد نتایج: 604350  

Journal: :JCM 2015
Hung-Bin Chang Izhak Rubin Ofer Hadar

—We consider adaptive-rate multicasting of video streams compressed by using Scalable Video Coding (SVC) over cellular wireless networks. Base station nodes coordinate the scheduling of their downlink transmissions to mitigate intercell interference; as well as, at times, to direct the multicast transmission of the same video streams to a group of clients, as implemented in a Multicast-Broadca...

Journal: :International Review of Electrical Engineering-iree 2023

The increasing trend of integrating Renewable Energy Sources (RESs) into power systems could cause operational challenges in the system from flexibility and reliability perspectives. Respectively, utilities would be relied on local flexible resources to address requirements systems. In this respect, distribution participate ancillary markets along with wholesale energy capacity shortage system....

Journal: :IEEE Journal on Selected Areas in Communications 2021

In this article, an unmanned aerial vehicle (UAV)-assisted wireless network is considered in which a battery-constrained UAV assumed to move towards energy-constrained ground nodes receive status updates about their observed processes. The UAV’s flight trajectory and scheduling of are jointly optimized with the objective minimizing normalized weighted sum Age Information (NWAoI) values for diff...

2009
Anna Pantelidou

Title of dissertation: A CROSS-LAYER STUDY OF THE SCHEDULING PROBLEM Anna Pantelidou, Doctor of Philosophy, 2009 Dissertation directed by: Professor Anthony Ephremides Department of Electrical and Computer Engineering This thesis is inspired by the need to study and understand the interdependence between the transmission powers and rates in an interference network, and how these two relate to t...

Using distributed generations (DGs) with optimal scheduling and optimal distribution feeder reconfiguration (DFR) are two aspects that can improve efficiency as well as technical and economic features of microgrids (MGs). This work presents a stochastic copula scenario-based framework to jointly carry out optimal scheduling of DGs and DFR. This framework takes into account non-dispatchable and ...

Journal: :journal of industrial engineering, international 2006
parviz fattahi mohammad saidi mehrabad mir b. aryanezhad

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

Journal: :European Journal of Operational Research 2014
Lixin Tang Jiao Zhao Jiyin Liu

This paper addresses the joint quay crane and truck scheduling problem at a container terminal, considering the coordination of the two types of equipment to reduce their idle time between performing two successive tasks. For the unidirectional flow problem with only inbound containers, in which trucks go back to quayside without carrying outbound containers, a mixed-integer linear programming ...

2008
Weiyan Ge Junshan Zhang Tolga M. Duman Arunabha Sen Cihan Tepedelenlioglu Guoliang Xue

This dissertation studies wireless scheduling by jointly optimizing the physical (PHY) layer and the medium-access-control (MAC) layer. It consists of the following three main thrusts. In the first thrust, rate optimization for multicast communications at the medium access control (MAC) layer is studied. For Threshold-T based multicast policies, the transmission rates are optimized to maximize ...

Journal: :journal of advances in computer research 2013
marjan abdeyazdan saeed parsa amir masoud rahmani

task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...

Journal: :Electronics 2023

As the amount of data input increases, fog devices on IoT edge networks become increasingly inefficient. However, a well-designed computing resource-scheduling strategy can help to reduce excessive time delays and energy consumption. Therefore, in this paper, we propose an efficient strategy. First, used particle swarm optimization (PSO) determine optimal load balance among nodes obtain computa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->