Efficient Strategy for Adaptive Partition of N-Dimensional Intervals in the Framework of Diagonal Algorithms

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.107, Iss.1, 2000-10, pp. : 145-168

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms

By Sergeyev Ya.

Journal of Optimization Theory and Applications, Vol. 124, Iss. 2, 2005-02 ,pp. : 503-510

Springer Publishing Company

Access to resources Recommend Favorite

An n-dimensional Pythagorean Theorem

By Cook William J.

The College Mathematics Journal, Vol. 44, Iss. 2, 2013-03 ,pp. : 98-101

Mathematical Association of America

Access to resources Recommend Favorite

Computing the Volume of n-Dimensional Copulas

By Cherubini Umberto Romagnoli Silvia

Applied Mathematical Finance, Vol. 16, Iss. 4, 2009-01 ,pp. : 307-314

Routledge Ltd

Access to resources Recommend Favorite

Efficient oblivious transfer with adaptive queries in UC framework

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 9, Iss. 15, 2016-10 ,pp. : 2592-2611

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the representation of n-dimensional fuzzy numbers and their informational content

By Zhang B. Wu C.

Fuzzy Sets and Systems, Vol. 128, Iss. 2, 2002-06 ,pp. : 227-235

Elsevier

Access to resources Recommend Favorite