Sciweavers

2226 search results - page 81 / 446
» Computable Analysis via Representations
Sort
View
CCA
2000
Springer
15 years 8 months ago
A Computable Spectral Theorem
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
Martin Ziegler, Vasco Brattka
HCW
1999
IEEE
15 years 8 months ago
Simulation of Task Graph Systems in Heterogeneous Computing Environments
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
Noé Lopez-Benitez, Ja-Young Hyon
RTSS
1998
IEEE
15 years 8 months ago
The Time-Triggered Model of Computation
: The Time-Triggered (TT) model of computation is a model for the representation and analysis of the design of large hard real-time systems. Central to this model is the concept of...
Hermann Kopetz
GBRPR
2009
Springer
15 years 11 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
GECCO
2004
Springer
113views Optimization» more  GECCO 2004»
15 years 9 months ago
Implications of Epigenetic Learning Via Modification of Histones on Performance of Genetic Programming
Extending the notion of inheritable genotype in genetic programming (GP) from the common model of DNA into chromatin (DNA and histones), we propose an approach of embedding in GP a...
Ivan Tanev, Kikuo Yuta