1197 search results - page 196 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
IPPS
1997
IEEE
14 years 8 days ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...
TIP
2010
13 years 2 months ago
2010
We develop two new algorithms for tomographic reconstruction which incorporate the technique of equally-sloped tomography (EST) and allow for the optimized and flexible implementat...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
PAMI
2011
13 years 3 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...