14739 search results - page 135 / 2948 » An optimization problem on the sphere |
CP
2007
Springer
15 years 4 months ago
2007
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
108
click to vote
IICAI
2003
14 years 11 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
ICCV
2007
IEEE
16 years 7 days ago
2007
IEEE
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
NIPS
2007
14 years 11 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
ASC
2004
14 years 10 months ago
2004
Global optimization can be used as the main component for reliable decision support systems. In this contribution, we explore numerical solution techniques for nonconvex and nondi...