14386 search results - page 199 / 2878 » The Chinese Generals Problem |
132
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
146
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
122
click to vote
KR
2010
Springer
15 years 8 months ago
2010
Springer
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
147
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
104
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...