811 search results - page 14 / 163 » An efficient algorithm for the configuration problem of domi... |
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 7 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
STOC
1991
ACM
13 years 11 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
CP
2009
Springer
14 years 8 months ago
2009
Springer
A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. ...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this study, we investigate the task scheduling problem in heterogeneous computing environments and propose a novel scheduling algorithm, called the Artificial Immune System wit...