58 search results - page 7 / 12 » A Parallel Algorithm for Weighted Distance Transforms |
DAM
2010
14 years 9 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
106
Voted
PDPTA
2000
15 years 1 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
99
Voted
PODC
2006
ACM
15 years 5 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...