9719 search results - page 197 / 1944 » Answer Set Optimization |
173
click to vote
GBRPR
2005
Springer
16 years 3 days ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
179
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
197
click to vote
JCO
1998
15 years 6 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
212
click to vote
ISNN
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. The performance of financial forecasting with neural networks dependents on the particular training set. We design mean-change-point test to divide the original dataset i...
177
click to vote
AHSWN
2008
15 years 6 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...