Sciweavers

11051 search results - page 191 / 2211
» An Investigation of Generalized Cases
Sort
View
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
16 years 21 days 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...
TIT
2010
102views Education» more  TIT 2010»
15 years 1 months ago
On instantaneous relaying
Abstract--The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) i...
Majid Nasiri Khormuji, Mikael Skoglund
ASM
2000
ASM
15 years 11 months ago
Partially Ordered Runs: A Case Study
Abstract. We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoni...
Yuri Gurevich, Dean Rosenzweig
SEMWEB
2007
Springer
16 years 20 days ago
A Survey and Categorization of Ontology Matching Cases
Methodologies to find and evaluate solutions for ontology matching should be centered on the practical problems to be solved. In this paper we look at matching from the perspectiv...
Zharko Aleksovski, Willem Robert van Hage, Antoine...
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 6 months ago
On Ritt's decomposition Theorem in the case of finite fields
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
Jaime Gutierrez, David Sevilla