Sciweavers

520 search results - page 46 / 104
» Map-reduce as a Programming Model for Custom Computing Machi...
Sort
View
91
Voted
ENDM
2010
101views more  ENDM 2010»
14 years 9 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ICML
2004
IEEE
15 years 3 months ago
Gradient LASSO for feature selection
LASSO (Least Absolute Shrinkage and Selection Operator) is a useful tool to achieve the shrinkage and variable selection simultaneously. Since LASSO uses the L1 penalty, the optim...
Yongdai Kim, Jinseog Kim
ICML
2007
IEEE
15 years 10 months ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
ICCSA
2005
Springer
15 years 3 months ago
An Economic Capacity Planning Model Considering Inventory and Capital Time Value
Abstract. A company needs to implement several make-to-stock policies apart from a regular make-to-order production, so that the capacity of expensive resources can be fully utiliz...
S. Michael Wang, Kung-Jeng Wang, Hui-Ming Wee, J. ...
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 1 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli