2182 search results - page 12 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
AAMAS
2010
Springer
13 years 7 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
CONSTRAINTS
1999
13 years 7 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Most camera calibration algorithms consider parameters that define the lens distortion mapping. The usual way to determine these parameters is to minimize a nonlinear optimization...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...