4744 search results - page 186 / 949 » Connected Computing |
174
click to vote
ACG
2006
Springer
16 years 1 months ago
2006
Springer
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
173
Voted
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
By Andr`e theory, it is well known how to algebraically convert a spread in a projective space to an equivalent spread (representing the same translation plane) in a projective sp...
187
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
173
Voted
SC
1993
ACM
15 years 11 months ago
1993
ACM
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
171
Voted
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...