418 search results - page 30 / 84 » Query Optimization by Simulated Annealing |
DSD
2003
IEEE
14 years 1 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
LAWEB
2003
IEEE
14 years 1 months ago
2003
IEEE
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
IWANN
1995
Springer
13 years 11 months ago
1995
Springer
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
COMBINATORICS
2002
13 years 7 months ago
2002
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
We apply multiple query optimization to batches of pull (on-demand) requests in a mobile database system. The resulting view can answer several queries at once, and it is broadcas...