Sciweavers

1080 search results - page 23 / 216
» Problem dependent optimization (PDO)
Sort
View
MP
2010
172views more  MP 2010»
15 years 2 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
ICASSP
2011
IEEE
14 years 7 months ago
Power allocation optimization in OFDM-based cognitive radios based on sensing information
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
Xiaoge Huang, Baltasar Beferull-Lozano
IUI
2012
ACM
13 years 11 months ago
Probabilistic pointing target prediction via inverse optimal control
Numerous interaction techniques have been developed that make “virtual” pointing at targets in graphical user interfaces easier than analogous physical pointing tasks by invok...
Brian D. Ziebart, Anind K. Dey, J. Andrew Bagnell
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 5 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
HM
2007
Springer
107views Optimization» more  HM 2007»
15 years 10 months ago
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Thomas Fischer, Peter Merz