11 years 9 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
201views Neural Networks» more  NC 2011»
13 years 2 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
78views more  IJFCS 2011»
13 years 2 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom
92views more  IJFCS 2010»
13 years 4 months ago
Collapsing the Hierarchy of Parallel Computational Models
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature,...
Stefan D. Bruda, Yuanqiao Zhang
13 years 5 months ago
CuHMMer: A load-balanced CPU-GPU cooperative bioinformatics application
Abstract—GPUs have recently been used to accelerate dataparallel applications for they provide easier programmability and increased generality while maintaining the tremendous me...
Ping Yao, Hong An, Mu Xu, Gu Liu, Xiaoqiang Li, Ya...
154views more  RTS 2002»
13 years 7 months ago
Flexible Soft Real-Time Processing in Middleware
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
Scott A. Brandt, Gary J. Nutt
158views more  ECCC 2000»
13 years 7 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
13 years 7 months ago
On the weight of universal insertion grammars
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
Lila Kari, Petr Sosík
135views more  IJVR 2007»
13 years 7 months ago
Impostors, Pseudo-instancing and Image Maps for GPU Crowd Rendering
— Rendering large crowds of characters requires a great amount of computational power. To increase the efficiency for this render, we propose the use of the graphics processor, i...
Erik Millán, Isaac Rudomín
100views more  IJFCS 2007»
13 years 7 months ago
On the Power of Deterministic and Sequential Communicating P Systems
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in...
Ludek Cienciala, Lucie Ciencialová, Pierlui...