Sciweavers

7522 search results - page 1114 / 1505
» Spacing memetic algorithms
Sort
View
CIKM
1994
Springer
15 years 8 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
VLDB
1994
ACM
137views Database» more  VLDB 1994»
15 years 8 months ago
Performance of Data-Parallel Spatial Operations
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
Erik G. Hoel, Hanan Samet
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 8 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CEC
2007
IEEE
15 years 8 months ago
Evolving hypernetworks for pattern classification
Abstract-- Hypernetworks consist of a large number of hyperedges that represent higher-order features sampled from training patterns. Evolutionary algorithms have been used as a me...
Joo-Kyung Kim, Byoung-Tak Zhang
CEC
2007
IEEE
15 years 8 months ago
Mobile robot global localization using differential evolution and particle swarm optimization
For a mobile robot to move in a known environment and operate successfully, first it needs to robustly determine its initial position and orientation relative to the map, and then ...
Ali R. Vahdat, Naser NourAshrafoddin, Saeed Shiry ...
« Prev « First page 1114 / 1505 Last » Next »