Results 211 to 220 of about 24,777 (243)
Some of the next articles are maybe not open access.
Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
We report our progress on computer chess last described at the Second Conference on Hypercubes. Our program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialized endgame evaluators, and so on.
Felton, Edward W., Otto, Steve W.
openaire +2 more sources
We report our progress on computer chess last described at the Second Conference on Hypercubes. Our program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialized endgame evaluators, and so on.
Felton, Edward W., Otto, Steve W.
openaire +2 more sources
2009
Bernstein's CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r , a block byte size b , and a digest bit length h (the compression function makes r rounds, while the finalization function makes 10r rounds).
Jean-Philippe Aumasson +4 more
openaire +3 more sources
Bernstein's CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r , a block byte size b , and a digest bit length h (the compression function makes r rounds, while the finalization function makes 10r rounds).
Jean-Philippe Aumasson +4 more
openaire +3 more sources
IEEE International Conference on Neural Networks, 2002
A discussion on learning from a geometric point of view is presented. Its main purpose is to obtain ways of pre-estimating the weights and thresholds of a neural network and of analyzing the corresponding effects on the learning procedure speed. It is conceivable that even a rough preliminary evaluation of the position of the hyperplanes will improve ...
Volnei A. Pedroni, Amnon Yariv
openaire +1 more source
A discussion on learning from a geometric point of view is presented. Its main purpose is to obtain ways of pre-estimating the weights and thresholds of a neural network and of analyzing the corresponding effects on the learning procedure speed. It is conceivable that even a rough preliminary evaluation of the position of the hyperplanes will improve ...
Volnei A. Pedroni, Amnon Yariv
openaire +1 more source
Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojun Shen, Edward M. Reingold
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojun Shen, Edward M. Reingold
openaire +1 more source
2006
In this paper we propose a semi-distributed self-diagnostic algorithm for Hypercube networks which is based on the use of a combinatorial structure known as the Hadamard matrix. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme.
Arif Ghafoor, Patrick Solé
openaire +2 more sources
In this paper we propose a semi-distributed self-diagnostic algorithm for Hypercube networks which is based on the use of a combinatorial structure known as the Hadamard matrix. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme.
Arif Ghafoor, Patrick Solé
openaire +2 more sources
2006 Canadian Conference on Electrical and Computer Engineering, 2006
Techniques for advanced logic design in spatial dimensions for the purposes of nano-devices and nanoICs are being formulated to incorporate topologies that satisfy certain requirements of nanotechnology. The hypercube is considered a relevant topology for this design.
Loyd Reed Hook, Samuel C. Lee
openaire +1 more source
Techniques for advanced logic design in spatial dimensions for the purposes of nano-devices and nanoICs are being formulated to incorporate topologies that satisfy certain requirements of nanotechnology. The hypercube is considered a relevant topology for this design.
Loyd Reed Hook, Samuel C. Lee
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1989
This paper considers the following game on a hypercube, first suggested by Lagarias and Saks. Suppose $2^n$ pebbles are distributed onto vertices of an n-cube (with $2^n$ vertices). A pebbling step is to remove two pebbles from some vertex and then place one pebble at an adjacent vertex. The question of interest is to determine if it is possible to get
openaire +2 more sources
This paper considers the following game on a hypercube, first suggested by Lagarias and Saks. Suppose $2^n$ pebbles are distributed onto vertices of an n-cube (with $2^n$ vertices). A pebbling step is to remove two pebbles from some vertex and then place one pebble at an adjacent vertex. The question of interest is to determine if it is possible to get
openaire +2 more sources
Random Structures and Algorithms, 2005
A point \(p\) in \(\mathbb R^d\) is said to dominate another point \(q\) if the difference \(p-q\) has only nonnegative coordinates. The nondominated points in a set of points are called maxima. The interest of studying dominance and maxima is multifold. First, dominance represents one of the most natural partial orders for multidimensional points, and
Zhi-Dong Bai +3 more
openaire +1 more source
A point \(p\) in \(\mathbb R^d\) is said to dominate another point \(q\) if the difference \(p-q\) has only nonnegative coordinates. The nondominated points in a set of points are called maxima. The interest of studying dominance and maxima is multifold. First, dominance represents one of the most natural partial orders for multidimensional points, and
Zhi-Dong Bai +3 more
openaire +1 more source
Journal of Graph Theory, 1984
AbstractAn induced subgraph G of a graph H is a retract of H if there is an edge‐preserving map f from H onto G such that f|G is the identity map on G. A median graph is a connected graph such that for any three vertices u,v and w, there exists a unique vertex x which lies simultaneously on some shortest (u,v)‐, (v,w)‐, and (w,u)‐paths.
openaire +3 more sources
AbstractAn induced subgraph G of a graph H is a retract of H if there is an edge‐preserving map f from H onto G such that f|G is the identity map on G. A median graph is a connected graph such that for any three vertices u,v and w, there exists a unique vertex x which lies simultaneously on some shortest (u,v)‐, (v,w)‐, and (w,u)‐paths.
openaire +3 more sources