Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CCCG
2010

favoriteEmaildiscussreport

154views Computational Geometry» more CCCG 2010»

On a dispersion problem in grid labeling

13 years 6 months ago

On a dispersion problem in grid labeling

Download www.cs.umanitoba.ca

Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the 1-distance between the two labels in each labeling. We present asymptotically optimal constructions of k labelings of cubical d-dimensional grids which maximize the minimum combined distance.

Minghui Jiang, Vincent Pilaud, Pedro J. Tejada

Real-time Traffic

CCCG 2010 | Computational Geometry | Cubical D-dimensional Grids | Finite D-dimensional Grid | Minimum Combined Distance |

claim paper

Related Content

» Simulated Annealing for Grid Scheduling Problem

» Ant Algorithm for Grid Scheduling Problem

» Scheduling of scientific workflows using Discrete PSO Algorithm for Grids

» Lp q labeling of ddimensional grids

» MultiGrid Acceleration of a SIMPLEBased CFDCode and Aspects of Parallelization

» Monitoring the connectivity of a grid

» Comparison of Scheduling Heuristics for Grid Resource Broker

» Soylent Grid its Made of People

» Towards Supporting FineGrained Access Control for Grid Resources

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	CCCG
Authors	Minghui Jiang, Vincent Pilaud, Pedro J. Tejada

Comments (0)