1127 search results - page 59 / 226 » Testing the Expansion of a Graph |
AAAI
1994
14 years 11 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
105
click to vote
SAC
2010
ACM
15 years 4 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
ICS
1989
Tsinghua U.
15 years 1 months ago
1989
Tsinghua U.
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...