14386 search results - page 394 / 2878 » The Chinese Generals Problem |
127
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
175
click to vote
MCU
2007
15 years 8 months ago
2007
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
119
click to vote
ENTCS
2008
15 years 7 months ago
2008
Consider the initial-value problem with computable parameters dx dt = p(t, x) x(t0) = x0, where p : Rn+1 Rn is a vector of polynomials and (t0, x0) Rn+1 . We show that the proble...
199
click to vote
JCT
2008
15 years 6 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
162
click to vote
ORL
2008
15 years 6 months ago
2008
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...