9719 search results - page 197 / 1944 » Answer Set Optimization |
179
Voted
GBRPR
2005
Springer
16 years 15 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...
187
Voted
CORR
2007
Springer
15 years 7 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...
211
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...
226
Voted
ISNN
2005
Springer
16 years 14 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...
192
Voted
AHSWN
2008
15 years 7 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...