263 search results - page 2 / 53 » Path partitions of hypercubes |
HIPC
2003
Springer
13 years 10 months ago
2003
Springer
This paper shows that an n = 2k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of a...
APPROX
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
AAAI
2010
13 years 6 months ago
2010
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
JSA
2000
13 years 5 months ago
2000
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...