14386 search results - page 224 / 2878 » The Chinese Generals Problem |
114
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
125
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
128
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
130
click to vote
AAIM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
113
click to vote
IJFCS
2008
15 years 4 months ago
2008
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called "strange billi...