187 search results - page 2 / 38 » On algorithms for discrete and approximate brouwer fixed poi... |
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
MOC
2011
13 years 1 months ago
2011
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
JGO
2010
13 years 4 months ago
2010
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
COCOA
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...