945 search results - page 43 / 189 » Working the Flow |
JMIV
2007
13 years 10 months ago
2007
We analyze the discrete maximum principle for the Beltrami color flow. The Beltrami flow can display linear as well as nonlinear behavior according to the values of a parameter ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
NETWORKS
2010
13 years 8 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
NOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
—With the emergence of on-chip networks, the power consumed by router buffers has become a primary concern. Bufferless flow control addresses this issue by removing router buffe...