L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Abstract. The secure deployment of components is widely recognized as a crucial problem in component-based software engineering. While major effort is concentrated on preventing ma...
Abstract. Given an evolutionary algorithm for a problem and an instance of the problem, the results of several trials of the EA on the instance constitute a sample from the distrib...
Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Juls...
One vision of the “Semantic Web” of the future is that software agents will interact with each other using formal metadata that reveal their interfaces. We examine one plausibl...
Drew V. McDermott, Mark H. Burstein, Douglas R. Sm...
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...