Sciweavers

2050 search results - page 155 / 410
» constraints 2010
Sort
View
FLOPS
2010
Springer
14 years 3 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
14 years 3 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
ECCV
2010
Springer
14 years 3 months ago
Photo-consistent Planar Patches from Unstructured Cloud of Points
Abstract. Planar patches are a very compact and stable intermediate representation of 3D scenes, as they are a good starting point for a complete automatic reconstruction of surfac...
CPAIOR
2010
Springer
14 years 3 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
ECCV
2010
Springer
14 years 2 months ago
Blind Reflectometry
We address the problem of inferring homogeneous reflectance (BRDF) from a single image of a known shape in an unknown real-world lighting environment. With appropriate representati...