Cited By
View all- Pavón M(2016)Injective Convex PolyhedraDiscrete & Computational Geometry10.1007/s00454-016-9810-656:3(592-630)Online publication date: 1-Oct-2016
It is shown that every measurable partition $$\{A_1,\ldots , A_k\}$${A1,ź,Ak} of $$\mathbb R ^3$$R3 satisfies $$\begin{aligned} \sum _{i=1}^k\big \Vert \int _{A_i} x\mathrm{{e}}^{-\frac{1}{2}\Vert x\Vert _2^2}\mathrm{{d}}x\big \Vert _2^2\leqslant 9\pi ^...
A new approach to derive Pareto front approximations with evolutionary computations is proposed here.
At present, evolutionary multiobjective optimization algorithms derive a discrete approximation of the Pareto front (the set of objective maps of ...
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = \left\{ {aijk} \right\}_{i,j,k = 1}^n such that for all i,j,k \in \left\{ {1, \ldots ,n} \right\} we have a_{ijk}= a_{ikj}= a_{kji}= a_{jik}= a_{kij}= a_{jki} ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in