240 search results - page 21 / 48 » Nonconvex Robust Optimization for Problems with Constraints |
KR
2004
Springer
14 years 26 days ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
NIPS
2008
13 years 9 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
ICRA
2002
IEEE
14 years 13 days ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
TSP
2010
13 years 2 months ago
2010
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...