14386 search results - page 72 / 2878 » The Chinese Generals Problem |
106
click to vote
MP
2002
15 years 2 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
114
Voted
IACR
2011
14 years 2 months ago
2011
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
123
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Optimal control and estimation are dual in the LQG setting, as Kalman discovered, however this duality has proven difficult to extend beyond LQG. Here we obtain a more natural...
119
Voted
IPCO
1998
15 years 4 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
150
click to vote
TMI
2010
14 years 10 months ago
2010
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...