1405 search results - page 7 / 281 » Popularity at Minimum Cost |
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...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Implementing a built-in self-test by a "test per clock" scheme offers advantages concerning fault coverage, detection of delay faults, and test application time. Such a ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
WSC
1997
13 years 8 months ago
1997
We present a novel adaptive synchronization algorithm, called the minimum average cost (MAC) algorithm, in the context of the ParaSol parallel simulation system. ParaSol is a mult...