182 search results - page 7 / 37 » Simple Generalized Maximum Flow Algorithms |
ICANN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a probabilistic interpretation of non-linear component extraction in neural networks that activate their hidden units according to a softmaxlike mechanism. On ...
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
IPL
2006
13 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
TIT
2008
13 years 7 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...