945 search results - page 66 / 189 » Working the Flow |
ENGL
2007
13 years 10 months ago
2007
—A Lagrangian-Eulerian numerical scheme for the investigation of bubble motion in turbulent flow is developed. The flow is analyzed in the Eulerian reference frame while the bubb...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
ASPLOS
2008
ACM
14 years 3 days ago
2008
ACM
It is not uncommon for modern systems to be composed of a variety of interacting services, running across multiple machines in such a way that most developers do not really unders...