Sciweavers

3656 search results - page 219 / 732
» Compact Location Problems
Sort
View
AAAI
2008
15 years 8 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...
TOG
2002
162views more  TOG 2002»
15 years 6 months ago
Jigsaw image mosaics
This paper introduces a new kind of mosaic, called Jigsaw Image Mosaic (JIM), where image tiles of arbitrary shape are used to compose the final picture. The generation of a Jigsa...
Junhwan Kim, Fabio Pellacini
PAMI
2007
131views more  PAMI 2007»
15 years 5 months ago
Photo-Consistent Reconstruction of Semitransparent Scenes by Density-Sheet Decomposition
—This paper considers the problem of reconstructing visually realistic 3D models of dynamic semitransparent scenes, such as fire, from a very small set of simultaneous views (eve...
Samuel W. Hasinoff, Kiriakos N. Kutulakos
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
15 years 1 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés