24 search results - page 3 / 5 » Explicit Reformulations for Robust Optimization Problems wit... |
169
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...
121
Voted
JSAC
2006
15 years 3 months ago
2006
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
144
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
142
Voted
NIPS
2008
15 years 5 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
138
Voted
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, the advantages of introducing an additional amount of tests when evolving parameters for specific purposes is discussed. A set of optimal PID-controller parameters...