We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...