Sciweavers

14161 search results - page 384 / 2833
» On generalized middle-level problem
Sort
View
IEEESCC
2009
IEEE
15 years 4 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
14 years 2 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
ICALP
2007
Springer
16 years 27 days ago
Boundedness of Monadic FO over Acyclic Structures
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...
Stephan Kreutzer, Martin Otto, Nicole Schweikardt
MCU
2007
123views Hardware» more  MCU 2007»
15 years 8 months ago
Study of Limits of Solvability in Tag Systems
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...
Liesbeth De Mol
ENTCS
2008
80views more  ENTCS 2008»
15 years 6 months ago
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
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...
Daniel S. Graça, Jorge Buescu, Manuel Lamei...