882 search results - page 58 / 177 » Local Search for Very Large SAT Problems |
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
102
click to vote
CP
2010
Springer
14 years 10 months ago
2010
Springer
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
111
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Large-scale 3D reconstruction has recently received much attention from the computer vision community. Bundle adjustment is a key component of 3D reconstruction problems. However,...
104
click to vote
CVPR
1996
IEEE
16 years 1 months ago
1996
IEEE
This paper addresses the problem of recognizing objects in large image databases. The method is based on local characteristics which are invariant to simzlarity transformations in...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...