New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...