Model-based view planning
From MaRDI portal
Publication:1008495
DOI10.1007/s00138-007-0110-2zbMath1331.68234OpenAlexW2078505501MaRDI QIDQ1008495
Publication date: 30 March 2009
Published in: Machine Vision and Applications (Search for Journal in Brave)
Full work available at URL: https://nrc-publications.canada.ca/eng/view/fulltext/?id=5c612b6d-9ff0-4970-8afd-e25cc4570bff
Cites Work
- Unnamed Item
- Unnamed Item
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Why aspect graphs are not (yet) practical for computer vision
- On the Greedy Heuristic for Continuous Covering and Packing Problems
- Algorithms for the set covering problem
This page was built for publication: Model-based view planning