Sciweavers

1438 search results - page 96 / 288
» Relational aspects as tracematches
Sort
View
ECAL
2003
Springer
15 years 11 months ago
Representation of Genotype and Phenotype in a Coherent Framework Based on Extended L-Systems
A formal language approach for the specification of ALife models is presented. “Relational Growth Grammars” incorporate rulebased, procedural and object-oriented concepts. By ...
Ole Kniemeyer, Gerhard H. Buck-Sorlin, Winfried Ku...
FM
2003
Springer
112views Formal Methods» more  FM 2003»
15 years 11 months ago
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
Michael Poppleton, Richard Banach
HPDC
2002
IEEE
15 years 11 months ago
A Comparison of TCP Automatic Tuning Techniques for Distributed Computing
Rather than painful, manual, static, per-connection optimization of TCP buffer sizes simply to achieve acceptable performance for distributed applications [8, 10], many researcher...
Eric Weigle, Wu-chun Feng
ECWEB
2001
Springer
117views ECommerce» more  ECWEB 2001»
15 years 11 months ago
Just Business -Shouldn't We Have Some Fun?
Information Technology has changed our life and society already to such an extent that even our visions cannot exist without technology and its applications. And this change is acc...
Hannes Werthner
CINQ
2004
Springer
182views Database» more  CINQ 2004»
15 years 10 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...