Sciweavers

309 search results - page 21 / 62
» Approximation algorithms for dynamic resource allocation
Sort
View
PDPTA
2007
13 years 9 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
14 years 16 days ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 19 days ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia
ICPPW
2007
IEEE
14 years 2 months ago
A Quality-Driven Algorithm for Resource Scheduling Based on Market Model on Grid
Several challenges about computational grid exist in integrating, coordinating and managing of resources and scheduling of applications, due to distributed resources at various le...
Lei Tang, Zhiyi Yang, Zhiwen Yu, Yunlan Wang
SECON
2010
IEEE
13 years 5 months ago
Distributed Routing, Relay Selection, and Spectrum Allocation in Cognitive and Cooperative Ad Hoc Networks
Throughput maximization is a key challenge in cognitive radio ad hoc networks, where the availability of local spectrum resources may change from time to time and hopby-hop. To ach...
Lei Ding, Tommaso Melodia, Stella N. Batalama, Joh...