14386 search results - page 271 / 2878 » The Chinese Generals Problem |
156
Voted
ICCV
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
151
click to vote
QCQC
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
160
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
163
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
137
click to vote
IPCO
2008
15 years 6 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...