#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2005

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Cosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa
- TAMC
- 2006

Membrane systems represent a new abstract model inspired by cell compartments and molecular membranes. Such a system is composed of various compartments, each compartment with a different task, and all of them working simultaneously to accomplish a more general task of the whole system. A detailed description of the membrane systems (also called P systems)… (More)

- Cosmin Bonchis, Gabriel Istrate
- ArXiv
- 2012

We propose a parametric family of measures of fairness in allocations of TU-cooperative games. Their definition is based on generalized Rényi Entropy, is related to the Cowell-Kuga generalized entropy indices in welfare economics, and aims to parallel the spirit of the notion of price of anarchy in the case of convex TU-cooperative games. Since computing… (More)

- Cosmin Bonchis, Cornel Izbasa, Gabriel Ciobanu
- 2006 Eighth International Symposium on Symbolic…
- 2006

In this paper we revise some previously defined non-positional number encodings using multisets and their associated arithmetic operations, describing a general encoding/decoding algorithm that can map natural numbers to their multiset representations, and vice versa. We present the templates for the most compact encodings in base b for successor and… (More)

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 based on CLIPS, and it is already available as a web application. The P accelerator is used to parallelize the existing sequential simulators of the P systems. We exemplify this… (More)

- Gabriel Istrate, Cosmin Bonchis
- DCFS
- 2016

- Andrada Baban, Cosmin Bonchis, Alexandru Fikl, Florin Rosu
- 2016 18th International Symposium on Symbolic and…
- 2016

In this paper, we explore how numerical calculations can be accelerated by implementing several numerical methods of fractional-order systems using parallel computing techniques. We investigate the feasibility of parallel computing algorithms and their efficiency in reducing the computational costs over a large time interval. Particularly, we present the… (More)

- Gabriel Istrate, Cosmin Bonchis
- CPM
- 2015

We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al. [BHMZ11]). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of… (More)

- Cosmin Bonchis, Cornel Izbasa, Gabriel Ciobanu
- Computing and Informatics
- 2008

Starting from Shannon theory of information, we present the case of producing information in the form of multisets, and encoding information using multisets. We compute the entropy of a multiset information source by constructing an equientropic string source (with interdependent symbols), and we compare this with a string information source with… (More)

- Cosmin Bonchis, Gabriel Istrate
- ArXiv
- 2014

We study minimum entropy submodular optimization, a common generalization of the minimum entropy set cover problem, studied earlier by Cardinal et al., and the submodular set cover problem (Wolsey [Wol82], Fujishige [BIKP01], etc). We give a general bound of the approximation performance of the greedy algorithm using an approach that can be interpreted in… (More)

- Cosmin Bonchis, Gabriel Ciobanu, Graiela Ghergu, Cornel Izbasa
- 2008 10th International Symposium on Symbolic and…
- 2008

Regular data compression converts a sequence of symbols into a sequence of strings (descriptions), assigning the shortest descriptions to the most frequent symbols produced by the data source. By contrast, here we consider the compression of a sequence of symbols to a sequence of multisets. This is relevant if the communication channel does not preserve… (More)