Sciweavers

24 search results - page 3 / 5
» Modelling Grammar Systems by Tissue P Systems Working in the...
Sort
View
CONCUR
2009
Springer
14 years 28 days ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
ICLP
2005
Springer
13 years 12 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 3 months ago
On Probabilistic Parallel Programs with Process Creation and Synchronisation
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo...
Stefan Kiefer, Dominik Wojtczak
IMSCCS
2006
IEEE
14 years 12 days ago
Parallel Multicategory Support Vector Machines (PMC-SVM) for Classifying Microcarray Data
Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of biological classification problems. However, the proc...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
SPAA
2005
ACM
13 years 12 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal