๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Branch-and-Bound Methods for Euclidean Registration Problems

โœ Scribed by Olsson, C.; Kahl, F.; Oskarsson, M.


Book ID
117931521
Publisher
IEEE
Year
2009
Tongue
English
Weight
989 KB
Volume
31
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Branch and bound methods for a search pr
โœ Alan R. Washburn ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A branch bound method for subset sum pro
โœ Shiquan Wu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 631 KB