Sciweavers

1200 search results - page 51 / 240
» Marked Ancestor Problems
Sort
View
ECML
2007
Springer
14 years 4 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
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...
Mark Schmidt, Glenn Fung, Rómer Rosales
CD
2004
Springer
14 years 3 months ago
Secure Deployment of Components
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...
Mark Grechanik, Dewayne E. Perry
GECCO
2004
Springer
14 years 3 months ago
How Are We Doing? Predicting Evolutionary Algorithm Performance
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...
SEMWEB
2001
Springer
14 years 2 months ago
Overcoming Ontology Mismatches in Transactions with Self-Describing Service Agents
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...
CCL
1994
Springer
14 years 2 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel