Sciweavers

73 search results - page 10 / 15
» On the Complexity of Solving a Bivariate Polynomial System
Sort
View
NC
2011
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
FSTTCS
2009
Springer
14 years 2 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
DATE
2010
IEEE
140views Hardware» more  DATE 2010»
14 years 19 days ago
Variation-aware interconnect extraction using statistical moment preserving model order reduction
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
Tarek A. El-Moselhy, Luca Daniel
GECCO
2004
Springer
14 years 28 days ago
Bounding Learning Time in XCS
It has been shown empirically that the XCS classifier system solves typical classification problems in a machine learning competitive way. However, until now, no learning time es...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi
CSL
2007
Springer
14 years 1 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek