Sciweavers

2126 search results - page 40 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 10 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
14 years 12 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
CEC
2009
IEEE
15 years 2 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao
JMLR
2010
143views more  JMLR 2010»
14 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
ACL
2010
14 years 8 months ago
WSD as a Distributed Constraint Optimization Problem
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledg...
Siva Reddy, Abhilash Inumella