14386 search results - page 221 / 2878 » The Chinese Generals Problem |
119
click to vote
JCT
2007
15 years 4 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
137
Voted
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
120
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
120
click to vote
CAISE
2005
Springer
15 years 10 months ago
2005
Springer
. This paper aims at proposing a global view of the interoperability problem, independently of any domain. We first describe explicitly the problem, and the context in which it app...
146
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...