Sciweavers

1346 search results - page 79 / 270
» On the number of rectangular partitions
Sort
View
GIS
1995
ACM
15 years 1 months ago
A Window Retrieval Algorithm for Spatial Databases Using Quadtrees
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
Walid G. Aref, Hanan Samet
TSMC
2008
189views more  TSMC 2008»
14 years 9 months ago
Automatic Clustering Using an Improved Differential Evolution Algorithm
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the aut...
Swagatam Das, Ajith Abraham, Amit Konar
APPT
2005
Springer
15 years 3 months ago
Static Partitioning vs Dynamic Sharing of Resources in Simultaneous MultiThreading Microarchitectures
Simultaneous MultiThreading (SMT) achieves better system resource utilization and higher performance because it exploits ThreadLevel Parallelism (TLP) in addition to “conventiona...
Chen Liu, Jean-Luc Gaudiot
EC
2007
118views ECommerce» more  EC 2007»
14 years 9 months ago
Geometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 2 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour