5889 search results - page 419 / 1178 » Graph Layout Problems |
220
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
177
click to vote
DAM
2008
15 years 7 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
144
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
160
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
173
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
In the context of the NAVIDOMASS project, the problematic of this paper concerns the clustering of historical document images. We propose a structural-based framework to handle the...