3958 search results - page 452 / 792 » Dynamic Graph Algorithms with Applications |
204
click to vote
IWCMC
2010
ACM
15 years 11 months ago
2010
ACM
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
176
click to vote
BPM
2006
Springer
15 years 10 months ago
2006
Springer
Composition languages like BPEL and many enactment tools only support structured process models, while most composition approaches only consider unstructured models. In this paper,...
184
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
178
click to vote
JGO
2010
15 years 5 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
195
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...