6105 search results - page 1032 / 1221 » A Parallel Algorithm for Bound-Smoothing |
172
click to vote
DAM
2010
15 years 6 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
149
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested i...
150
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
150
Voted
DSS
2006
15 years 6 months ago
2006
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...
186
Voted
JPDC
2006
15 years 6 months ago
2006
Conventional performance evaluation mechanisms focus on dedicated systems. Grid computing infrastructure, on the other hand, is a shared collaborative environment constructed on v...