160 search results - page 26 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
152
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
149
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
170
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
156
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
146
Voted
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...