Sciweavers

1242 search results - page 229 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
ALT
1995
Springer
13 years 11 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
BIRTHDAY
2010
Springer
13 years 7 months ago
The Edge of Graph Transformation - Graphs for Behavioural Specification
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
Arend Rensink
CSDA
2006
84views more  CSDA 2006»
13 years 7 months ago
Performing hypothesis tests on the shape of functional data
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
Gareth M. James, Ashish Sood
TASE
2008
IEEE
13 years 7 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
DAC
2011
ACM
12 years 7 months ago
Supervised design space exploration by compositional approximation of Pareto sets
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca,...