1447 search results - page 216 / 290 » Graphs and Path Equilibria |
156
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
152
click to vote
IJFCS
1998
15 years 6 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
168
click to vote
TIP
1998
15 years 6 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
158
click to vote
OTM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
203
click to vote
TIT
2010
15 years 1 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...