1142 search results - page 164 / 229 » Set Variables and Local Search |
100
Voted
IEICET
2006
15 years 2 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
106
click to vote
PAMI
1998
15 years 2 months ago
1998
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the p...
129
click to vote
PVLDB
2010
15 years 27 days ago
2010
Today’s data integration systems must be flexible enough to support the typical iterative and incremental process of integration, and may need to scale to hundreds of data sour...
163
Voted
FOGA
2011
14 years 6 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
145
Voted
AI
2010
Springer
15 years 2 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...