14386 search results - page 310 / 2878 » The Chinese Generals Problem |
149
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
128
click to vote
ECIS
2001
15 years 6 months ago
2001
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
156
Voted
IJCAI
2001
15 years 6 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
145
Voted
SODA
2000
ACM
15 years 6 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
140
Voted
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...