83 search results - page 7 / 17 » tcs 2010 |
TCS
2010
14 years 8 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
108
click to vote
TCS
2010
14 years 4 months ago
2010
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
TCS
2010
14 years 4 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
TCS
2010
14 years 8 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
70
Voted
TCS
2010
14 years 8 months ago
2010
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...