7522 search results - page 417 / 1505 » Spacing memetic algorithms |
179
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
213
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
206
click to vote
SODA
2001
ACM
15 years 9 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
192
Voted
AAAI
2000
15 years 9 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
208
click to vote
VMV
2003
15 years 9 months ago
2003
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...