4843 search results - page 411 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
NIPS
1996
15 years 6 months ago
1996
Abstract. In this paper we investigate the feed-forward learning problem. The well-known ill-conditioning which is present in most feed-forward learning problems is shown to be the...
220
click to vote
IPL
2006
15 years 4 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
154
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
142
click to vote
INFORMS
2007
15 years 4 months ago
2007
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...
217
click to vote
SIGPRO
2010
15 years 3 months ago
2010
Total Variation (TV) regularization is a popular method for solving a wide variety of inverse problems in image processing. In order to optimize the reconstructed image, it is imp...