2880 search results - page 264 / 576 » Approximate Range Searching |
125
Voted
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
141
click to vote
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
137
click to vote
CP
2007
Springer
15 years 7 months ago
2007
Springer
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. Constraint generated for these ta...
122
click to vote
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
140
click to vote
AAAI
1996
15 years 5 months ago
1996
This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bindings as much as possible; (2) a strategy in which no non-primitive task i...