554 search results - page 55 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
133
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
162
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
141
click to vote
HPDC
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
162
click to vote
JUCS
2010
15 years 3 months ago
2010
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
141
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...