Sciweavers

5316 search results - page 283 / 1064
» Which Search Problems Are Random
Sort
View
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
16 years 6 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 8 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
CCGRID
2006
IEEE
15 years 8 months ago
Density-Based Clustering for Similarity Search in a P2P Network
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
Mouna Kacimi, Kokou Yétongnon
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 10 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
GECCO
2009
Springer
15 years 9 months ago
Search based data sensitivity analysis applied to requirement engineering
Software engineering is plagued by problems associated with unreliable cost estimates. This paper introduces an approach to sensitivity analysis for requirements engineering. It u...
Mark Harman, Jens Krinke, Jian Ren, Shin Yoo