577 search results - page 40 / 116 » New interval methods for constrained global optimization |
136
click to vote
EOR
2008
15 years 3 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
132
click to vote
IOR
2008
15 years 3 months ago
2008
When a manufacturer places repeated orders with a supplier to meet changing production requirements, he faces the challenge of finding the right balance between holding costs and ...
115
click to vote
ICCD
2004
IEEE
16 years 21 days ago
2004
IEEE
Potential slack is an effective metric of circuit’s possible performance improvement. It is equal to the maximal amount of slack that can be potentially used for optimization. I...
116
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
138
click to vote
TOG
2008
15 years 3 months ago
2008
Simulated characters in simulated worlds require simulated skills. We develop control strategies that enable physically-simulated characters to dynamically navigate environments w...