2322 search results - page 259 / 465 » On a game in directed graphs |
169
click to vote
SI3D
2003
ACM
15 years 11 months ago
2003
ACM
Many virtual environments and games must be populated with synthetic characters to create the desired experience. These characters must move with sufficient realism, so as not to...
164
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
185
click to vote
ECEASST
2006
15 years 6 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
229
click to vote
ECCC
2007
15 years 6 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
191
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...