522 search results - page 91 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
93
Voted
GECCO
2008
Springer
15 years 24 days ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
108
click to vote
TON
2010
14 years 6 months ago
2010
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
—A mobile device in a MANET must be assigned a free IP address before it may participate in unicast communication. This is a fundamental and difficult problem in the practical us...
NIPS
1994
15 years 1 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...