( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities.

. Informatica, 19 (4): 567-596 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Yaroslav Epifanov

Yaroslav Cherednikov

Elena Sergeyev

Yaroslav Yatsyshyn

Yaroslav Terentiev

 

Другие публикации лиц с тем же именем

Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms. CoRR, (2011)On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales., , и . CoRR, (2018)Two methods for solving optimization problems arising in electronic measurements and electrical engineering, , , и . CoRR, (2011)Dynamic Process Scheduling in a Parallel Logic Machine., , , и . IJCSLP Workshop on Concurrent and Parallel Implementations, (1992)Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems., , , и . NUMTA (2), том 11974 из Lecture Notes in Computer Science, стр. 337-345. Springer, (2019)Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering., , , и . SIAM J. Optimization, 10 (1): 1-21 (1999)The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area.. Commun. Nonlinear Sci. Numer. Simul., 31 (Issues): 21-29 (2016)Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants, и . CoRR, (2011)Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions., , и . Reliab. Comput., 6 (2): 179-191 (2000)On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms., , , , и . Numer. Algorithms, 37 (1-4): 61-69 (2004)