Sciweavers

6437 search results - page 2 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
13 years 10 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura
ICS
2000
Tsinghua U.
13 years 10 months ago
Improving parallel system performance by changing the arrangement of the network links
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
Valentin Puente, Cruz Izu, José A. Gregorio...
WAE
2000
95views Algorithms» more  WAE 2000»
13 years 8 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
INFOVIS
1998
IEEE
13 years 11 months ago
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recur...
Mihael Ankerst, Stefan Berchtold, Daniel A. Keim