463 search results - page 17 / 93 » The Most Reliable Subgraph Problem |
117
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
104
click to vote
CN
2004
15 years 1 months ago
2004
Securing ad hoc networks in a fully self-organized way is effective and light-weight, but fails to accomplish trust initialization in many trust deficient scenarios. To overcome t...
102
Voted
DAM
2007
15 years 1 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
145
Voted
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
105
Voted
WSC
1998
15 years 3 months ago
1998
For large investment projects sensitivity analysis is an important tool to determine which factors need further analysis and/or can jeopardize the future of a project. In practice...