Sciweavers

93 search results - page 2 / 19
» Computational Complexity in Non-Turing Models of Computation...
Sort
View
ECAL
2005
Springer
13 years 10 months ago
Simulating Evolution with a Computational Model of Embryogeny: Obtaining Robustness from Evolved Individuals
Abstract. An evolutionary system is presented which employs an embryogeny model to evolve phenotypes in the form of layout of cells in specific patterns and shapes. It is shown th...
Chris P. Bowers
HT
2007
ACM
13 years 9 months ago
What is an analogue for the semantic web and why is having one important?
This paper postulates that for the Semantic Web to grow and gain input from fields that will surely benefit it, it needs to develop an analogue that will help people not only unde...
m. c. schraefel
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
13 years 10 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
EICS
2010
ACM
13 years 10 months ago
Self-explanatory user interfaces by model-driven engineering
Modern User Interfaces (UI) must deal with the increasing complexity of applications as well as new features such as the capacity of UIs to be dynamically adapted to the context o...
Alfonso García Frey
AICOM
2002
103views more  AICOM 2002»
13 years 5 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen