463 search results - page 40 / 93 » The Most Reliable Subgraph Problem |
146
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
142
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
105
click to vote
ICCAD
2008
IEEE
15 years 10 months ago
2008
IEEE
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...
108
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
ICNP
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper we address the problem of providing transparent, reliable, and efficient network-level multicasting in wormhole LANs. We describe some alternatives for achieving dea...