Sciweavers

83 search results - page 2 / 17
» Approximation algorithms for homogeneous polynomial optimiza...
Sort
View
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
13 years 6 months ago
Automated techniques for energy efficient scheduling on homogeneous and heterogeneous chip multi-processor architectures
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
Sushu Zhang, Karam S. Chatha
ICC
2008
IEEE
130views Communications» more  ICC 2008»
13 years 11 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
TON
2008
119views more  TON 2008»
13 years 4 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
13 years 5 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
COREGRID
2007
Springer
13 years 10 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo