292 search results - page 12 / 59 » Dormant program nodes and the efficiency of genetic programm... |
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
BIOINFORMATICS
2006
13 years 7 months ago
2006
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
ICES
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that co...
APPT
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
AINA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Reprogramming node software over-the-air is an essential requirement in many wireless sensor network applications due to the inaccessibility of the deployed sensor nodes. Trans...