1963 search results - page 204 / 393 » The Maximum Solution Problem on Graphs |
112
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
105
click to vote
GLOBECOM
2008
IEEE
15 years 2 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
110
Voted
SAC
2008
ACM
15 years 18 days ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
115
Voted
DDECS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
107
Voted
DAM
2002
15 years 28 days ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...