Sciweavers

1914 search results - page 70 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
15 years 2 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
15 years 4 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
ISDA
2008
IEEE
15 years 4 months ago
Inertia-Adaptive Particle Swarm Optimizer for Improved Global Search
This paper describes a method for improving the final accuracy and the convergence speed of Particle Swarm Optimization (PSO) by adapting its inertia factor in the velocity updati...
Kaushik Suresh, Sayan Ghosh, Debarati Kundu, Abhir...