5922 search results - page 397 / 1185 » Navigability of Complex Networks |
142
Voted
SCHEDULING
2010
15 years 3 months ago
2010
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
131
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract —Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO c...
156
Voted
BMCBI
2004
15 years 4 months ago
2004
Background: Recent technological advances in high-throughput data collection allow for experimental study of increasingly complex systems on the scale of the whole cellular genome...
169
click to vote
MOBIHOC
2002
ACM
16 years 4 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...
168
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture in peers, it simpli...