1725 search results - page 257 / 345 » Relaxed genetic programming |
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way ...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
111
click to vote
AAAI
2011
13 years 10 months ago
2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
113
click to vote
JMLR
2012
13 years 10 days ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
JMLR
2012
13 years 10 days ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...