14548 search results - page 85 / 2910 » The Optimal Path-Matching Problem |
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
MP
2010
13 years 8 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
CISSE
2009
Springer
13 years 7 months ago
2009
Springer
In Component-based Software (CBS) development, it is desirable to choose software components that provide all necessary functionalities and at the same time optimize certain nonfun...
JOTA
2010
13 years 4 months ago
2010
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
JMLR
2010
13 years 4 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...