Sciweavers

1458 search results - page 82 / 292
» Extended Term Rewriting Systems
Sort
View
IJSI
2008
109views more  IJSI 2008»
14 years 10 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 4 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
CIDR
2009
159views Algorithms» more  CIDR 2009»
14 years 11 months ago
RIOT: I/O-Efficient Numerical Computing without SQL
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
Yi Zhang 0011, Herodotos Herodotou, Jun Yang 0001
APAL
2007
79views more  APAL 2007»
14 years 10 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
15 years 1 months ago
Algebraic observer for a class of switched systems with zeno phenomenon
For a large class of switched systems with zeno phenomenon, classical observer cannot be applied directly since the terms leading to zeno phenomenon are not derivable. However in t...
Gang Zheng, Lei Yu, Driss Boutat, Jean-Pierre Barb...