796 search results - page 50 / 160 » Approximating the centroid is hard |
134
click to vote
JNS
2010
15 years 4 months ago
2010
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
155
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
191
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
154
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
210
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...