5214 search results - page 667 / 1043 » The Online Specialization Problem |
195
Voted
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
179
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
196
Voted
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
197
click to vote
ACTA
2010
15 years 7 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
199
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...