Sciweavers

3333 search results - page 419 / 667
» Optimal Power-Down Strategies
Sort
View
CEC
2010
IEEE
15 years 5 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
CPAIOR
2010
Springer
15 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CVPR
2012
IEEE
13 years 9 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
CVPR
2007
IEEE
16 years 9 months ago
Precise Registration of 3D Models To Images by Swarming Particles
The precise alignment of a 3D model to 2D sensor images to recover the pose of an object in a scene is an important topic in computer vision. In this work, we outline a registrati...
Joerg Liebelt, Klaus Schertler
ICIP
2005
IEEE
16 years 9 months ago
Greedy non-linear approximation of the plenoptic function for interactive transmission of 3D scenes
We consider an interactive browsing environment, with greedy optimization of a current view, conditioned on the availability of previously transmitted information for other (possi...
Pietro Zanuttigh, Nicola Brusco, David Taubman, Gu...