Sciweavers

14548 search results - page 138 / 2910
» The Optimal Path-Matching Problem
Sort
View
FOCS
2010
IEEE
13 years 8 months ago
The Coin Problem and Pseudorandomness for Branching Programs
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...
Joshua Brody, Elad Verbin
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 10 months ago
An optimization problem on the sphere
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...
Andreas Maurer
SIAMJO
2002
142views more  SIAMJO 2002»
13 years 10 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
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 ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 5 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
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...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 11 months ago
Accelerating convergence using rough sets theory for multi-objective optimization problems
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 ...
Luis V. Santana-Quintero, Carlos A. Coello Coello