default search action
Yaroslav D. Sergeyev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j86]Marco Cococcioni
, Alessandro Cudazzo, Lorenzo Fiaschi, Massimo Pappalardo, Yaroslav D. Sergeyev:
A new cutting plane method for lexicographic multi-objective integer linear programming. Commun. Nonlinear Sci. Numer. Simul. 129: 107674 (2024) - [j85]Yaroslav D. Sergeyev
Numerical methods using two different approximations of space-filling curves for black-box global optimization. J. Glob. Optim. 88(3): 707-722 (2024) - [j84]Daniela Lera, Maria Chiara Nasso, Mikhail Posypkin, Yaroslav D. Sergeyev
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots. J. Glob. Optim. 89(2): 415-434 (2024) - 2023
- [j83]Alberto Falcone
Advantages of the usage of the Infinity Computer for reducing the Zeno behavior in hybrid system models. Soft Comput. 27(12): 8189-8208 (2023) - 2022
- [j82]Alberto Falcone
Simulation of hybrid systems under Zeno behavior using numerical infinitesimals. Commun. Nonlinear Sci. Numer. Simul. 111: 106443 (2022) - [j81]Hoai An Le Thi, Tao Pham Dinh, Yaroslav D. Sergeyev:
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8-10, 2019. J. Glob. Optim. 82(4): 655-657 (2022) - [j80]Yaroslav D. Sergeyev
A Generator of Multiextremal Test Classes With Known Solutions for Black-Box-Constrained Global Optimization. IEEE Trans. Evol. Comput. 26(6): 1261-1270 (2022) - 2021
- [j79]Daniela Lera, Mikhail Posypkin, Yaroslav D. Sergeyev:
Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics. Appl. Math. Comput. 390: 125660 (2021) - [j78]Alberto Falcone
A Simulink-based software solution using the Infinity Computer methodology for higher order differentiation. Appl. Math. Comput. 409: 125606 (2021) - [j77]Luigi Brugnano
Preface to the virtual special issue recent developments in applied mathematics and computation. Appl. Math. Comput. 409: 126023 (2021) - [j76]Yaroslav D. Sergeyev, Maria Chiara Nasso, Marat S. Mukhametzhanov
Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives. J. Comput. Appl. Math. 383: 113134 (2021) - [j75]Felice Iavernaro
Computation of higher order Lie derivatives on the Infinity Computer. J. Comput. Appl. Math. 383: 113135 (2021) - [j74]Luigi Brugnano
Foreword to the virtual special issue dedicated to the 3rd International Conference NUMTA 2019 "Numerical Computations: Theory and Algorithms". J. Comput. Appl. Math. 393: 113545 (2021) - [j73]André H. Deutz, Michael Emmerich, Yaroslav D. Sergeyev, Iryna Yevseyeva:
Preface to the special issue dedicated to the 14th international workshop on global optimization held in Leiden, The Netherlands, September 18-21, 2018. J. Glob. Optim. 79(2): 279-280 (2021) - [j72]Roberto Cavoretto
On the search of the shape parameter in radial basis functions using univariate global optimization methods. J. Glob. Optim. 79(2): 305-327 (2021) - [j71]Hoai An Le Thi
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8-10, 2019. Optim. Lett. 15(7): 2347-2349 (2021) - [j70]Yaroslav D. Sergeyev:
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas "Bayesian and High-Dimensional Global Optimization", SpringerBriefs in Optimization, Springer, 2021. Optim. Lett. 15(8): 2897-2899 (2021) - 2020
- [j69]Marco Cococcioni
Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology. Commun. Nonlinear Sci. Numer. Simul. 84: 105177 (2020) - [j68]Remigijus Paulavicius
Globally-biased BIRECT algorithm with local accelerators for expensive global optimization. Expert Syst. Appl. 144: 113052 (2020) - [j67]Renato De Leone
Iterative Grossone-Based Computation of Negative Curvature Directions in Large-Scale Optimization. J. Optim. Theory Appl. 186(2): 554-589 (2020) - [j66]Renato De Leone, Yaroslav D. Sergeyev, Gerardo Toraldo:
To the special issue dedicated to the 3rd international conference "Numerical Computations: Theory and Algorithms - NUMTA 2019" June 15-21, 2019, Isola Capo Rizzuto, Italy. Soft Comput. 24(23): 17495-17496 (2020) - [j65]Alberto Falcone
Representation of grossone-based arithmetic in simulink for scientific computing. Soft Comput. 24(23): 17525-17539 (2020) - [j64]Yaroslav D. Sergeyev
Safe global optimization of expensive noisy black-box functions in the δ-Lipschitz framework. Soft Comput. 24(23): 17715-17735 (2020) - [e3]Yaroslav D. Sergeyev
Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part I. Lecture Notes in Computer Science 11973, Springer 2020, ISBN 978-3-030-39080-8 [contents] - [e2]Yaroslav D. Sergeyev
Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part II. Lecture Notes in Computer Science 11974, Springer 2020, ISBN 978-3-030-40615-8 [contents]
2010 – 2019
- 2019
- [c14]Yaroslav D. Sergeyev:
The Infinity Computer for Optimization and Not Only. DS-RT 2019: 1 - [c13]Marco Cococcioni
Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems. NUMTA (2) 2019: 337-345 - [c12]Alberto Falcone
A Simulink-Based Infinity Computer Simulator and Some Applications. NUMTA (2) 2019: 362-369 - [c11]Dmitri E. Kvasov
On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods. NUMTA (2) 2019: 413-421 - [i22]Yaroslav D. Sergeyev, Antonio Candelieri, Dmitri E. Kvasov, Riccardo Perego:
Safe global optimization of expensive noisy black-box functions in the $δ$-Lipschitz framework. CoRR abs/1908.06010 (2019) - 2018
- [j63]Luigi Brugnano
Foreword to the special issue ''Recent Trends in Numerical Computations: Theory and Algorithms''. Appl. Math. Comput. 318: 1-2 (2018) - [j62]Vladimir A. Grishagin
Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes. Appl. Math. Comput. 318: 270-280 (2018) - [j61]Marco Cococcioni
Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm. Appl. Math. Comput. 318: 298-311 (2018) - [j60]Yaroslav D. Sergeyev
On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. Commun. Nonlinear Sci. Numer. Simul. 59: 319-330 (2018) - [j59]Renato De Leone
Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming. Comput. Optim. Appl. 71(1): 73-93 (2018) - [j58]Renato De Leone
Guest editors' preface to the special issue devoted to the 2nd International Conference "Numerical Computations: Theory and Algorithms", June 19-25, 2016, Pizzo Calabro, Italy. J. Glob. Optim. 71(1): 1-4 (2018) - [j57]Daniela Lera, Yaroslav D. Sergeyev
GOSH: derivative-free global optimization using multi-dimensional space-filling curves. J. Glob. Optim. 71(1): 193-211 (2018) - [j56]Yaroslav D. Sergeyev:
Non-convex multi-objective optimization. Optim. Methods Softw. 33(2): 416-417 (2018) - [c10]Renato De Leone
How Grossone Can Be Helpful to Iteratively Compute Negative Curvature Directions. LION 2018: 180-183 - [i21]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. CoRR abs/1801.05306 (2018) - 2017
- [j55]Pierluigi Amodio
A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic. Math. Comput. Simul. 141: 24-39 (2017) - [j54]Yaroslav D. Sergeyev
Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms. Math. Comput. Simul. 141: 96-109 (2017) - [c9]Yaroslav D. Sergeyev
Emmental-Type GKLS-Based Multiextremal Smooth Test Problems with Non-linear Constraints. LION 2017: 383-388 - [e1]Roberto Battiti, Dmitri E. Kvasov
Learning and Intelligent Optimization - 11th International Conference, LION 11, Nizhny Novgorod, Russia, June 19-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10556, Springer 2017, ISBN 978-3-319-69403-0 [contents] - 2016
- [j53]Yaroslav D. Sergeyev
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) - [j52]Yaroslav D. Sergeyev, Marat S. Mukhametzhanov, Francesca Mazzia, Felice Iavernaro, Pierluigi Amodio:
Numerical Methods for Solving Initial Value Problems on the Infinity Computer. Int. J. Unconv. Comput. 12(1): 3-23 (2016) - [j51]Yaroslav D. Sergeyev
Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization. J. Optim. Theory Appl. 171(1): 186-208 (2016) - [j50]Yaroslav D. Sergeyev
Preface to the Special Issue "Recent developments in non-linear and global optimization". Optim. Lett. 10(2): 215-218 (2016) - [p1]Yaroslav D. Sergeyev
On the Least-Squares Fitting of Data by Sinusoids. Advances in Stochastic and Deterministic Global Optimization 2016: 209-226 - 2015
- [j49]Dmitri E. Kvasov
Deterministic approaches for solving practical black-box global optimization problems. Adv. Eng. Softw. 80: 58-66 (2015) - [j48]Renato De Leone
Guest editors' foreword to the special issue devoted to the international conference "Numerical computations: Theory and Algorithms" June 17-23, 2013, Falerna, Italy. Appl. Math. Comput. 255: 1-2 (2015) - [j47]D. I. Iudin, Yaroslav D. Sergeyev
Infinity computations in cellular automaton forest-fire model. Commun. Nonlinear Sci. Numer. Simul. 20(3): 861-870 (2015) - [j46]Luigi Brugnano
Preface to the special issue NUMTA 2013. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 1-2 (2015) - [j45]Yaroslav D. Sergeyev
A deterministic global optimization using smooth diagonal auxiliary functions. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 99-111 (2015) - [j44]D. I. Iudin, Yaroslav D. Sergeyev
Reprint of Infinity computations in cellular automaton forest-fire model. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 190-199 (2015) - [j43]Daniela Lera, Yaroslav D. Sergeyev
Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants. Commun. Nonlinear Sci. Numer. Simul. 23(Issues): 328-342 (2015) - [c8]Yaroslav D. Sergeyev
Computations with Grossone-Based Infinities. UCNC 2015: 89-106 - [i20]Daniela Lera, Yaroslav D. Sergeyev:
Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants. CoRR abs/1509.03590 (2015) - [i19]Yaroslav D. Sergeyev, Dmitri E. Kvasov:
A deterministic global optimization using smooth diagonal auxiliary functions. CoRR abs/1509.04518 (2015) - 2014
- [j42]Remigijus Paulavicius
Globally-biased Disimpl algorithm for expensive global optimization. J. Glob. Optim. 59(2-3): 545-567 (2014) - [j41]Manlio Gaudioso
Vladimir Fedorovich Demyanov (18.08.1938-18.04.2014). J. Glob. Optim. 60(3): 391-392 (2014) - [c7]Yaroslav D. Sergeyev
Examples of the Usage of Infinities and Infinitesimals in Numerical Computations. WIVACE 2014: 190-200 - 2013
- [j40]Dmitri E. Kvasov
Lipschitz global optimization methods in control problems. Autom. Remote. Control. 74(9): 1435-1448 (2013) - [j39]Yaroslav D. Sergeyev
Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically. Appl. Math. Comput. 219(22): 10668-10681 (2013) - [j38]Daniela Lera, Yaroslav D. Sergeyev
Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives. SIAM J. Optim. 23(1): 508-529 (2013) - [j37]Yaroslav D. Sergeyev
Single-tape and multi-tape Turing machines through the lens of the Grossone methodology. J. Supercomput. 65(2): 645-663 (2013) - [i18]Daniela Lera, Yaroslav D. Sergeyev:
Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives. CoRR abs/1307.3522 (2013) - [i17]Yaroslav D. Sergeyev:
Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically. CoRR abs/1307.3529 (2013) - [i16]Yaroslav D. Sergeyev, Alfredo Garro:
Single-tape and Multi-tape Turing machines through the lens of the Grossone methodology. CoRR abs/1307.3976 (2013) - [i15]Dmitri E. Kvasov, Yaroslav D. Sergeyev:
Lipschitz gradients for global optimization in a one-point-based partitioning scheme. CoRR abs/1307.4302 (2013) - 2012
- [j36]Renato De Leone, Yaroslav D. Sergeyev
Foreword: Special issue INFINITY 2010. Appl. Math. Comput. 218(16): 7977-7978 (2012) - [j35]D. I. Iudin, Yaroslav D. Sergeyev
Interpretation of percolation in terms of infinity computations. Appl. Math. Comput. 218(16): 8099-8111 (2012) - [j34]Dmitri E. Kvasov
Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236(16): 4042-4054 (2012) - [c6]Yaroslav D. Sergeyev:
The Infinity Computer and Numerical Computations with Infinite and Infinitesimal Numbers. IJCCI 2012 - [i14]Yaroslav D. Sergeyev:
Numerical computations and mathematical modelling with infinite and infinitesimal numbers. CoRR abs/1203.3163 (2012) - [i13]Yaroslav D. Sergeyev:
Higher order numerical differentiation on the Infinity Computer. CoRR abs/1203.3164 (2012) - [i12]Yaroslav D. Sergeyev:
Methodology of Numerical Computations with Infinities and Infinitesimals. CoRR abs/1203.3165 (2012) - [i11]Yaroslav D. Sergeyev, Alfredo Garro:
Observability of Turing Machines: a Refinement of the Theory of Computation. CoRR abs/1203.3298 (2012) - 2011
- [j33]Yaroslav D. Sergeyev:
Using Blinking Fractals for Mathematical Modeling of Processes of Growth in Biological Systems. Informatica 22(4): 559-576 (2011) - [j32]Yaroslav D. Sergeyev
Higher order numerical differentiation on the Infinity Computer. Optim. Lett. 5(4): 575-585 (2011) - [i10]Yaroslav D. Sergeyev, Dmitri E. Kvasov:
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants. CoRR abs/1103.2056 (2011) - [i9]Yaroslav D. Sergeyev:
Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms. CoRR abs/1103.2657 (2011) - [i8]Marco Gaviano, Dmitri E. Kvasov, Daniela Lera, Yaroslav D. Sergeyev:
Software for Generation of Classes of Test Functions with Known Local and Global Minima for Global Optimization. CoRR abs/1103.2695 (2011) - [i7]Yaroslav D. Sergeyev, Paolo Pugliese, Domenico Famularo:
Index Information Algorithm with Local Tuning for Solving Multidimensional Global Optimization Problems with Multiextremal Constraints. CoRR abs/1103.3390 (2011) - [i6]Dmitri E. Kvasov, Clara Pizzuti, Yaroslav D. Sergeyev:
Local tuning and partition strategies for diagonal GO methods. CoRR abs/1103.3665 (2011) - [i5]Yaroslav D. Sergeyev, Domenico Famularo, Paolo Pugliese:
Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints. CoRR abs/1103.3791 (2011) - [i4]Yaroslav D. Sergeyev, Pasquale Daponte, Domenico Grimaldi, Anna Molinaro:
Two methods for solving optimization problems arising in electronic measurements and electrical engineering. CoRR abs/1103.3801 (2011) - [i3]Yaroslav D. Sergeyev:
Parallel Information Algorithm with Local Tuning for Solving Multidimensional GO Problems. CoRR abs/1103.6006 (2011) - [i2]Yaroslav D. Sergeyev:
Univariate global optimization with multiextremal non-differentiable constraints without penalty functions. CoRR abs/1107.5269 (2011) - [i1]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Falah M. H. Khalaf:
A One-Dimensional Local Tuning Algorithm for Solving GO Problems with Partially Defined Constraints. CoRR abs/1107.5280 (2011) - 2010
- [j31]Yaroslav D. Sergeyev, Alfredo Garro:
Observability of Turing Machines: A Refinement of the Theory of Computation. Informatica 21(3): 425-454 (2010) - [j30]Panos M. Pardalos, Yaroslav D. Sergeyev
Foreword: Special issue celebrating the 70th birthday of Roman G. Strongin. J. Glob. Optim. 48(1): 1-2 (2010) - [j29]Daniela Lera, Yaroslav D. Sergeyev
An information global minimization algorithm using the local improvement technique. J. Glob. Optim. 48(1): 99-112 (2010) - [c5]Yaroslav D. Sergeyev
A New Computational Methodology Using Infinite and Infinitesimal Numbers. ACRI 2010: 646-649 - [c4]Yaroslav D. Sergeyev:
The Infinity Computer and Numerical Computations with Infinite and Infinitesimal Numbers. CSC 2010: 6-12 - [c3]Yaroslav D. Sergeyev:
Modelling Discrete and Continuos in the Framework of the New Computational Paradigm Working Numerically with Infinite and Infinitesimal Numbers. CSC 2010: 13
2000 – 2009
- 2009
- [j28]Dmitri E. Kvasov
A univariate global search working with a set of Lipschitz constants for the first derivative. Optim. Lett. 3(2): 303-318 (2009) - 2008
- [j27]Yaroslav D. Sergeyev:
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities. Informatica 19(4): 567-596 (2008) - 2007
- [j26]Yaroslav D. Sergeyev
A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints. Optim. Lett. 1(1): 85-99 (2007) - 2006
- [j25]Luciano Carotenuto, Paolo Pugliese, Yaroslav D. Sergeyev:
Maximizing Performance and Robustness of pi and PID controllers by Global Optimization. Control. Intell. Syst. 34(3) (2006) - [j24]Yaroslav D. Sergeyev
Univariate Global Optimization with Multiextremal Non-Differentiable Constraints Without Penalty Functions. Comput. Optim. Appl. 34(2): 229-248 (2006) - [j23]Yaroslav D. Sergeyev
Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants. SIAM J. Optim. 16(3): 910-937 (2006) - [j22]Yaroslav D. Sergeyev:
Mathematical foundations of the infinity computer. Ann. UMCS Informatica 4(1): 20-33 (2006) - 2004
- [j21]Domenico Famularo
Global optimization technique for fixed-order control design. Int. J. Syst. Sci. 35(7): 425-434 (2004) - [j20]J. A. Martínez, Leocadio G. Casado
On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms. Numer. Algorithms 37(1-4): 61-69 (2004) - 2003
- [j19]Leocadio G. Casado
New Interval Analysis Support Functions Using Gradient Information in a Global Minimization Algorithm. J. Glob. Optim. 25(4): 345-362 (2003) - [j18]Roman G. Strongin
Global Optimization: Fractal Approach and Non-redundant Parallelism. J. Glob. Optim. 27(1): 25-50 (2003) - [j17]Yaroslav D. Sergeyev
Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints. Math. Program. 96(3): 489-512 (2003) - [j16]Dmitri E. Kvasov
Local tuning and partition strategies for diagonal GO methods. Numerische Mathematik 94(1): 93-106 (2003) - [j15]Marco Gaviano, Dmitri E. Kvasov
Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 29(4): 469-480 (2003) - 2002
- [j14]Leocadio G. Casado
Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions. SIAM J. Sci. Comput. 24(2): 359-376 (2002) - 2001
- [j13]Anna Molinaro, Clara Pizzuti, Yaroslav D. Sergeyev
Acceleration Tools for Diagonal Information Global Optimization Algorithms. Comput. Optim. Appl. 18(1): 5-26 (2001) - [j12]Vladimir A. Grishagin
Firms' R&D decisions under incomplete information. Eur. J. Oper. Res. 129(2): 414-433 (2001) - [j11]Yaroslav D. Sergeyev
Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints. J. Glob. Optim. 21(3): 317-341 (2001) - [j10]Anna Molinaro, Yaroslav D. Sergeyev
Finding the Minimal Root of an Equation with the Multiextremal and Nondifferentiable Left-Hand Part. Numer. Algorithms 28(1-4): 255-272 (2001) - 2000
- [j9]Leocadio G. Casado
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions. Reliab. Comput. 6(2): 179-191 (2000)
1990 – 1999
- 1999
- [j8]Domenico Famularo
A global optimization technique for checking parametric robustness. Autom. 35(9): 1605-1611 (1999) - [j7]Yaroslav D. Sergeyev:
Parallel Information Algorithm with Local Tuning for Solving Multidimensional GO Problems. J. Glob. Optim. 15(2): 157-167 (1999) - [j6]Yaroslav D. Sergeyev
Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering. SIAM J. Optim. 10(1): 1-21 (1999) - 1998
- [j5]Yaroslav D. Sergeyev
Global one-dimensional optimization using smooth auxiliary functions. Math. Program. 81: 127-146 (1998) - 1997
- [j4]Vladimir A. Grishagin
Parallel Characteristical Algorithms for Solving Problems of Global Optimization. J. Glob. Optim. 10(2): 185-206 (1997) - 1995
- [j3]Yaroslav D. Sergeyev
An algorithm for solving global optimization problems with nonlinear constraints. J. Glob. Optim. 7(4): 407-419 (1995) - [j2]Yaroslav D. Sergeyev
An Information Global Optimization Algorithm with Local Tuning. SIAM J. Optim. 5(4): 858-870 (1995) - 1993
- [c2]Mario Cannataro, Yaroslav D. Sergeyev, Giandomenico Spezzano, Domenico Talia:
A Dynamic Load Balancing Strategy for Massively Parallel Computers. PARLE 1993: 664-667 - 1992
- [j1]Roman G. Strongin
Global multidimensional optimization on parallel computer. Parallel Comput. 18(11): 1259-1273 (1992) - [c1]Mario Cannataro, Yaroslav D. Sergeyev, Giandomenico Spezzano, Domenico Talia:
Dynamic Process Scheduling in a Parallel Logic Machine. IJCSLP Workshop on Concurrent and Parallel Implementations 1992
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-11 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: