100 search results - page 5 / 20 » A distance-labelling problem for hypercubes |
PODS
1993
ACM
14 years 1 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
APPML
2006
13 years 9 months ago
2006
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
JGO
2010
13 years 8 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider a generalization of stochastic bandit problems where the set of arms, X, is allowed to be a generic topological space. We constraint the mean-payoff function with a di...
JSAT
2008
13 years 9 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...