2322 search results - page 305 / 465 » On a game in directed graphs |
154
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
185
click to vote
HICSS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
164
click to vote
TNN
1998
15 years 6 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
209
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
164
click to vote
TASLP
2008
15 years 6 months ago
2008
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...