14386 search results - page 333 / 2878 » The Chinese Generals Problem |
173
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
164
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
181
click to vote
MOC
2002
15 years 5 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
134
click to vote
TSMC
1998
15 years 5 months ago
1998
Circular features have been commonly used in numerous computer vision application areas for 3-D pose estimation. However, the estimation of such a feature’s pose from 2-D image ...
153
click to vote
TEC
2002
15 years 5 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...