100 search results - page 2 / 20 » A distance-labelling problem for hypercubes |
SIAMJO
2010
13 years 1 months ago
2010
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...
JCT
2011
13 years 1 months ago
2011
We consider the problem of orienting the edges of the n-dimensional hypercube so only two different in-degrees a and b occur. We show that this can be done, for two specified in...
TIT
2010
13 years 1 months ago
2010
Abstract--Glass models are frequently used to model gene regulatory networks. A distinct feature of the Glass model is that its dynamics can be formalized as paths through multi-di...
IPL
2010
13 years 4 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
CEC
2008
IEEE
14 years 23 days ago
2008
IEEE
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...