Sciweavers

3049 search results - page 205 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
TIT
2011
193views more  TIT 2011»
15 years 1 months ago
Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks
—Maximization of the weighted sum-rate of secondary users (SUs) possibly equipped with multiantenna transmitters and receivers is considered in the context of cognitive radio (CR...
Seung-Jun Kim, Georgios B. Giannakis
CIRA
2007
IEEE
274views Robotics» more  CIRA 2007»
16 years 25 days ago
Adaptive Object Tracking using Particle Swarm Optimization
—This paper presents an automatic object detection and tracking algorithm by using particle swarm optimization (PSO) based method, which is a searching algorithm inspired by the ...
Yuhua Zheng, Yan Meng
ICALP
2009
Springer
16 years 1 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
FSTTCS
2009
Springer
15 years 11 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
CP
2008
Springer
15 years 8 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus