Sciweavers

54 search results - page 7 / 11
» Liquid State Genetic Programming
Sort
View
RTA
2007
Springer
14 years 1 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
AAAI
1994
13 years 9 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
VLC
2002
93views more  VLC 2002»
13 years 7 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase
ATAL
2006
Springer
13 years 11 months ago
Exploring sensor networks using mobile agents
Today's wireless sensor networks have limited flexibility because their software is static. Mobile agents alleviate this problem by introducing mobile code and state. Mobile ...
Daniel Massaguer, Chien-Liang Fok, Nalini Venkatas...
BMCBI
2007
161views more  BMCBI 2007»
13 years 7 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo