Sciweavers

1182 search results - page 44 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
101
Voted
ICASSP
2011
IEEE
14 years 5 months ago
Fixed point iteration for max-min sir balancing with general interference functions
This paper studies the convergence of a fixed point iteration algorithm for the problem of max-min signal-to-interference ratio (SIR) balancing. Differently from the existing wor...
Nikola Vucic, Martin Schubert
107
Voted
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
15 years 1 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
M. C. Campi, A. Lecchini, Sergio M. Savaresi
102
Voted
STACS
2007
Springer
15 years 8 months ago
Cost Sharing Methods for Makespan and Completion Time Scheduling
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
Janina A. Brenner, Guido Schäfer
ML
2002
ACM
128views Machine Learning» more  ML 2002»
15 years 1 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 3 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...