Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Video delivery from a server to a client across a network is an important component of many multimedia applications. While delivering a video stream across a resource constrained ...
The optimization of similarity queries using metric access methods has been widely discussed in the last decades. Similarity queries consider one object as the query center, and re...
Humberto Luiz Razente, Maria Camila Nardini Barion...
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...