In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
Background: There are many methods for analyzing microarray data that group together genes having similar patterns of expression over all conditions tested. However, in many insta...
Joseph C. Roden, Brandon W. King, Diane Trout, Ali...
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
Serge Gaspers, Margaret-Ellen Messinger, Richard J...
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...