UC
2005
Springer
13 years 10 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used i...
UC
2005
Springer
13 years 10 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
UC
2005
Springer
13 years 10 months ago
2005
Springer
UC
2005
Springer
13 years 10 months ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
UC
2005
Springer
13 years 10 months ago
2005
Springer
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
UC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we present WebPS, an open-source web-enabled simulator for P systems, and a P accelerator for parallelization of the existing sequential simulators. The simulator is ...
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. It is an unconventional computation approach to evolve solutions instead of calculating them. Although using evolutionary computation in computer science dates back to th...