Sciweavers

4074 search results - page 398 / 815
» Abstract Graph Transformation
Sort
View
FMSD
2008
94views more  FMSD 2008»
15 years 6 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
IJON
2007
84views more  IJON 2007»
15 years 6 months ago
Modeling self-developing biological neural networks
Recent progress in chips–neuron interface suggests real biological neurons as long-term alternatives to silicon transistors. The first step ning such computing systems is to bu...
Hugues Berry, Olivier Temam
182
Voted
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 7 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
IANDC
2006
97views more  IANDC 2006»
15 years 6 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
ICDCS
2006
IEEE
16 years 24 days ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu