124 search results - page 3 / 25 » The Undecidability of the Generalized Collatz Problem |
SBMF
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
114
click to vote
DNA
2007
Springer
15 years 3 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
IANDC
2007
14 years 9 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
IJFCS
2008
14 years 9 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...
TCS
2010
14 years 8 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...