Sciweavers

292 search results - page 15 / 59
» Dormant program nodes and the efficiency of genetic programm...
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
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...
ASPLOS
2006
ACM
13 years 11 months ago
Efficient type and memory safety for tiny embedded systems
We report our experience in implementing type and memory safety in an efficient manner for sensor network nodes running TinyOS: tiny embedded systems running legacy, C-like code. ...
John Regehr, Nathan Cooprider, Will Archer, Eric E...
IJDAR
2006
131views more  IJDAR 2006»
13 years 7 months ago
Genetic engineering of hierarchical fuzzy regional representations for handwritten character recognition
This paper presents a genetic programming based approach for optimizing the feature extraction step of a handwritten character recognizer. This recognizer uses a simple multilayer ...
Christian Gagné, Marc Parizeau
PPOPP
1991
ACM
13 years 11 months ago
Dynamic Node Reconfiguration in a Parallel-Distributed Environment
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the netwo...
Michael J. Feeley, Brian N. Bershad, Jeffrey S. Ch...