14386 search results - page 387 / 2878 » The Chinese Generals Problem |
199
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
168
click to vote
SIAMDM
2010
15 years 5 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
166
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
173
click to vote
CPM
2007
Springer
16 years 1 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
180
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...