1046 search results - page 64 / 210 » Approximation Algorithms for Domination Search |
119
Voted
SODA
1993
ACM
15 years 1 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
91
Voted
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
We apply evolutionary computation to calibrate the parameters of a morphogenesis model of Drosophila early development. The model aims to describe the establishment of the steady g...
JSS
2010
14 years 7 months ago
2010
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
UAI
2003
15 years 1 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...