14548 search results - page 138 / 2910 » The Optimal Path-Matching Problem |
115
click to vote
FOCS
2010
IEEE
15 years 8 days ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
112
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
146
click to vote
SIAMJO
2002
15 years 1 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
164
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
14 years 9 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
134
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...