Sciweavers

2050 search results - page 167 / 410
» constraints 2010
Sort
View
ENTCS
2006
161views more  ENTCS 2006»
13 years 10 months ago
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...
Hartmut Ehrig, Karsten Ehrig
EOR
2006
70views more  EOR 2006»
13 years 10 months ago
Search allocation game
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
Ryusuke Hohzaki
EOR
2006
59views more  EOR 2006»
13 years 10 months ago
Sensitivity analysis in linear optimization: Invariant support set intervals
Sensitivity analysis is one of the most interesting and preoccupying areas in optimization. Many attempts are made to investigate the problem's behavior when the input data c...
Alireza Ghaffari Hadigheh, Tamás Terlaky
ENTCS
2007
82views more  ENTCS 2007»
13 years 10 months ago
A Simple Calculus for Proteins and Cells
The use of process calculi to represent biological systems has led to the design of different formalisms such as brane calculi and κ-calculus. Both have proved to be useful to m...
Cosimo Laneve, Fabien Tarissan
ENTCS
2007
108views more  ENTCS 2007»
13 years 10 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig