6575 search results - page 231 / 1315 » Specializing visualization algorithms |
223
click to vote
HPCC
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. Even though there have been many research works on distributed deadlock detection and recovery mechanisms, the multi-cycle deadlock problems are not extensively studied y...
176
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
180
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
212
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorith...
165
click to vote
ICNP
1998
IEEE
15 years 10 months ago
1998
IEEE
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...