Sciweavers

182 search results - page 11 / 37
» P Automata: Concepts, Results, and New Aspects
Sort
View
AOSD
2005
ACM
14 years 4 months ago
Towards a catalog of aspect-oriented refactorings
In this paper, we present a collection of aspect-oriented refactorings covering both the extraction of aspects from objectoriented legacy code and the subsequent tidying up of the...
Miguel P. Monteiro, João M. Fernandes
INFOCOM
2005
IEEE
14 years 4 months ago
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
MFCS
2009
Springer
14 years 5 months ago
Snake-Deterministic Tiling Systems
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind ...
Violetta Lonati, Matteo Pradella
ENTCS
2002
91views more  ENTCS 2002»
13 years 10 months ago
Petri nets with causal time for system verification
We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progr...
Cécile Bui Thanh, Hanna Klaudel, Franck Pom...
AAIM
2008
Springer
119views Algorithms» more  AAIM 2008»
14 years 5 months ago
Engineering Comparators for Graph Clusterings
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
Daniel Delling, Marco Gaertler, Robert Görke,...