Sciweavers

995 search results - page 84 / 199
» Wire-speed total order
Sort
View
JETAI
2008
93views more  JETAI 2008»
13 years 8 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
IVC
2006
101views more  IVC 2006»
13 years 8 months ago
Numerical error analysis in Zernike moments computation
An exact analysis of the numerical errors being generated during the computation of the Zernike moments, by using the well-known `q-recursive' method, is attempted in this pa...
George A. Papakostas, Yiannis S. Boutalis, Constan...
JSAC
2008
56views more  JSAC 2008»
13 years 8 months ago
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product spac
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato
JCM
2006
76views more  JCM 2006»
13 years 8 months ago
Hierarchical Aggregation of Multicast Trees in Large Domains
Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups...
Joanna Moulierac, Alexandre Guitton, Miklós...
NETWORKS
2008
13 years 8 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...