Sciweavers

757 search results - page 19 / 152
» How to decide
Sort
View
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 7 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
ENTCS
2006
154views more  ENTCS 2006»
13 years 7 months ago
Applying a Model Transformation Taxonomy to Graph Transformation Technology
A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best sui...
Tom Mens, Pieter Van Gorp, Dániel Varr&oacu...
FUIN
2006
111views more  FUIN 2006»
13 years 7 months ago
Typing the Behavior of Software Components using Session Types
This paper proposes the use of session types to extend with behavioural information the simple descriptions usually provided by software component interfaces. We show how session t...
Antonio Vallecillo, Vasco Thudichum Vasconcelos, A...
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 7 months ago
On model selection and the disability of neural networks to decompose tasks
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
Marc Toussaint
CORR
2010
Springer
71views Education» more  CORR 2010»
13 years 5 months ago
Equality, Quasi-Implicit Products, and Large Eliminations
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impl...
Vilhelm Sjöberg, Aaron Stump