Увійти

Готові списки джерел за темами / Nonmonotone techniques / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Nonmonotone techniques.

Статті в журналах з теми "Nonmonotone techniques"

Автор: Grafiati

Опубліковано: 10 березня 2023

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Nonmonotone techniques".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Toint, Philippe L. "An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization." SIAM Journal on Scientific Computing 17, no. 3 (1996): 725–39. http://dx.doi.org/10.1137/s106482759427021x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Rapajić, Sanja, and Zoltan Pap. "Smoothing inexact Newton methods for NCP with various nonmonotone techniques." PAMM 13, no. 1 (2013): 385–86. http://dx.doi.org/10.1002/pamm.201310188.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Cui, Zhaocheng, Boying Wu, and Shaojian Qu. "Combining nonmonotone conic trust region and line search techniques for unconstrained optimization." Journal of Computational and Applied Mathematics 235, no. 8 (2011): 2432–41. http://dx.doi.org/10.1016/j.cam.2010.10.044.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Ahmadvand, M., M. Esmaeilbeigi, A. Kamandi, and F. M. Yaghoobi. "A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques." Computational Optimization and Applications 72, no. 2 (2018): 499–524. http://dx.doi.org/10.1007/s10589-018-0051-x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Xiao, Yi, and Eric King-Wah Chu. "A nonmonotone inexact Newton algorithm for nonlinear systems of equations." Journal of the Australian Mathematical Society. Series B. Applied Mathematics 36, no. 4 (1995): 460–92. http://dx.doi.org/10.1017/s0334270000007499.

Повний текст джерела

Анотація:

AbstractIn this paper, an inexact Newton's method for nonlinear systems of equations is proposed. The method applies nonmonotone techniques and Newton's as well as inexact Newton's methods can be viewed as special cases of this new method. The method converges globally and quadratically. Some numerical experiments are reported for both standard test problems and an application in the computation of Hopf bifurcation points.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Bianconcini, Tommaso, and Marco Sciandrone. "A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques." Optimization Methods and Software 31, no. 5 (2016): 1008–35. http://dx.doi.org/10.1080/10556788.2016.1155213.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Li, Chengbo, Charles C. Mosher, and Yongchang Ji. "An amplitude-preserving deblending approach for simultaneous sources." GEOPHYSICS 84, no. 3 (2019): V185—V196. http://dx.doi.org/10.1190/geo2018-0240.1.

Повний текст джерела

Анотація:

A goal of simultaneous shooting is to acquire high-quality seismic data more efficiently, while reducing operational costs and improving acquisition efficiency. Effective sampling and deblending techniques are essential to achieve this goal. Inspired by compressive sensing (CS), we have formulated deblending as an analysis-based sparse inversion problem. We solve the inversion problem with an algorithm derived from the classic alternating direction method (ADM), associated with variable splitting and nonmonotone line-search techniques. In our testing, the analysis-based formulation together wi

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Candito, Pasquale, Umberto Guarnotta та Roberto Livrea. "Existence of two solutions for singular Φ-Laplacian problems". Advanced Nonlinear Studies 22, № 1 (2022): 659–83. http://dx.doi.org/10.1515/ans-2022-0037.

Повний текст джерела

Анотація:

Abstract Existence of two solutions to a parametric singular quasi-linear elliptic problem is proved. The equation is driven by the Φ \Phi -Laplacian operator, and the reaction term can be nonmonotone. The main tools employed are the local minimum theorem and the Mountain pass theorem, together with the truncation technique. Global C 1 , τ {C}^{1,\tau } regularity of solutions is also investigated, chiefly via a priori estimates and perturbation techniques.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Alzeley, Omar, Ehab M. Almetwally, Ahmed M. Gemeay, Huda M. Alshanbari, E. H. Hafez, and M. H. Abu-Moussa. "Statistical Inference under Censored Data for the New Exponential-X Fréchet Distribution: Simulation and Application to Leukemia Data." Computational Intelligence and Neuroscience 2021 (August 29, 2021): 1–16. http://dx.doi.org/10.1155/2021/2167670.

Повний текст джерела

Анотація:

In reliability studies, the best fitting of lifetime models leads to accurate estimates and predictions, especially when these models have nonmonotone hazard functions. For this purpose, the new Exponential-X Fréchet (NEXF) distribution that belongs to the new exponential-X (NEX) family of distributions is proposed to be a superior fitting model for some reliability models with nonmonotone hazard functions and beat the competitive distribution such as the exponential distribution and Frechet distribution with two and three parameters. So, we concentrated our effort to introduce a new novel mod

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Ullrich, Paul A., Dharshi Devendran, and Hans Johansen. "Arbitrary-Order Conservative and Consistent Remapping and a Theory of Linear Maps: Part II." Monthly Weather Review 144, no. 4 (2016): 1529–49. http://dx.doi.org/10.1175/mwr-d-15-0301.1.

Повний текст джерела

Анотація:

Abstract This paper extends on the first part of this series by describing four examples of 2D linear maps that can be constructed in accordance with the theory of the earlier work. The focus is again on spherical geometry, although these techniques can be readily extended to arbitrary manifolds. The four maps include conservative, consistent, and (optionally) monotone linear maps (i) between two finite-volume meshes, (ii) from finite-volume to finite-element meshes using a projection-type approach, (iii) from finite-volume to finite-element meshes using volumetric integration, and (iv) betwee

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Babaie-Kafaki, Saman, and Saeed Rezaee. "A randomized nonmonotone adaptive trust region method based on the simulated annealing strategy for unconstrained optimization." International Journal of Intelligent Computing and Cybernetics 12, no. 3 (2019): 389–99. http://dx.doi.org/10.1108/ijicc-12-2018-0178.

Повний текст джерела

Анотація:

PurposeThe purpose of this paper is to employ stochastic techniques to increase efficiency of the classical algorithms for solving nonlinear optimization problems.Design/methodology/approachThe well-known simulated annealing strategy is employed to search successive neighborhoods of the classical trust region (TR) algorithm.FindingsAn adaptive formula for computing the TR radius is suggested based on an eigenvalue analysis conducted on the memoryless Broyden-Fletcher-Goldfarb-Shanno updating formula. Also, a (heuristic) randomized adaptive TR algorithm is developed for solving unconstrained op

Стилі APA, Harvard, Vancouver, ISO та ін.

12

De Bem Francisco, Juliano, and Tiara Martini. "Spectral Projected Gradient Method for the Procrustes Problem." TEMA (São Carlos) 15, no. 1 (2014): 083. http://dx.doi.org/10.5540/tema.2014.015.01.0083.

Повний текст джерела

Анотація:

We study and analyze a nonmonotone globally convergent method for minimization on closed sets. This method is based on the ideas from trust-region and Levenberg-Marquardt methods. Thus, the subproblems consists in minimizing a quadratic model of the objective function subject to the constraint set. We incorporate concepts of bidiagonalization and calculation of the SVD "with inaccuracy'' to improve the performance of the algorithm, since the solution of the subproblem by traditional techniques, which is required in each iteration, is computationally expensive. Other feasible methods are mentio

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Muse, Abdisalam Hassan, Samuel Mwalili, Oscar Ngesa, Saad J. Almalki, and Gamal A. Abd-Elmougod. "Bayesian and Classical Inference for the Generalized Log-Logistic Distribution with Applications to Survival Data." Computational Intelligence and Neuroscience 2021 (October 11, 2021): 1–24. http://dx.doi.org/10.1155/2021/5820435.

Повний текст джерела

Анотація:

The generalized log-logistic distribution is especially useful for modelling survival data with variable hazard rate shapes because it extends the log-logistic distribution by adding an extra parameter to the classical distribution, resulting in greater flexibility in analyzing and modelling various data types. We derive the fundamental mathematical and statistical properties of the proposed distribution in this paper. Many well-known lifetime special submodels are included in the proposed distribution, including the Weibull, log-logistic, exponential, and Burr XII distributions. The maximum l

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Grippo, L., F. Lampariello, and S. Lucidi. "A Nonmonotone Line Search Technique for Newton’s Method." SIAM Journal on Numerical Analysis 23, no. 4 (1986): 707–16. http://dx.doi.org/10.1137/0723046.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Ou, Yigui, and Yuanwen Liu. "A memory gradient method based on the nonmonotone technique." Journal of Industrial & Management Optimization 13, no. 2 (2017): 857–72. http://dx.doi.org/10.3934/jimo.2016050.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Huang, Shuai, Zhong Wan, and Xiaohong Chen. "A new nonmonotone line search technique for unconstrained optimization." Numerical Algorithms 68, no. 4 (2014): 671–89. http://dx.doi.org/10.1007/s11075-014-9866-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Yu, Zhensheng, and Dingguo Pu. "A new nonmonotone line search technique for unconstrained optimization." Journal of Computational and Applied Mathematics 219, no. 1 (2008): 134–44. http://dx.doi.org/10.1016/j.cam.2007.07.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Hu, Ping, and Xu-Qing Liu. "A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization." Journal of Optimization Theory and Applications 158, no. 3 (2012): 773–86. http://dx.doi.org/10.1007/s10957-012-0247-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Gao, Jing, Jian Cao, and Yueting Yang. "A Derivative-Free Trust Region Algorithm with Nonmonotone Filter Technique for Bound Constrained Optimization." Mathematical Problems in Engineering 2018 (October 23, 2018): 1–13. http://dx.doi.org/10.1155/2018/5049027.

Повний текст джерела

Анотація:

We propose a derivative-free trust region algorithm with a nonmonotone filter technique for bound constrained optimization. The derivative-free strategy is applied for special minimization functions in which derivatives are not all available. A nonmonotone filter technique ensures not only the trust region feature but also the global convergence under reasonable assumptions. Numerical experiments demonstrate that the new algorithm is effective for bound constrained optimization. Locally, optimal parameters with respect to overall computational time on a set of test problems are identified. The

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Han, Congying, Tingting Feng, Guoping He, and Tiande Guo. "Parallel Variable Distribution Algorithm for Constrained Optimization with Nonmonotone Technique." Journal of Applied Mathematics 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/295147.

Повний текст джерела

Анотація:

A modified parallel variable distribution (PVD) algorithm for solving large-scale constrained optimization problems is developed, which modifies quadratic subproblemQPlat each iteration instead of theQPl0of the SQP-type PVD algorithm proposed by C. A. Sagastizábal and M. V. Solodov in 2002. The algorithm can circumvent the difficulties associated with the possible inconsistency ofQPl0subproblem of the original SQP method. Moreover, we introduce a nonmonotone technique instead of the penalty function to carry out the line search procedure with more flexibly. Under appropriate conditions, the gl

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Diniz-Ehrhardt, M. A., J. M. Martínez, and M. Raydan. "A derivative-free nonmonotone line-search technique for unconstrained optimization." Journal of Computational and Applied Mathematics 219, no. 2 (2008): 383–97. http://dx.doi.org/10.1016/j.cam.2007.07.017.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Grippo, L., F. Lampariello, and S. Lucidi. "A quasi-discrete Newton algorithm with a nonmonotone stabilization technique." Journal of Optimization Theory and Applications 64, no. 3 (1990): 495–510. http://dx.doi.org/10.1007/bf00939421.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Su, Ke, and Zhensheng Yu. "A modified SQP method with nonmonotone technique and its global convergence." Computers & Mathematics with Applications 57, no. 2 (2009): 240–47. http://dx.doi.org/10.1016/j.camwa.2008.05.030.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Zhang, Hongchao, and William W. Hager. "A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization." SIAM Journal on Optimization 14, no. 4 (2004): 1043–56. http://dx.doi.org/10.1137/s1052623403428208.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Huang, Shuai, Zhong Wan, and Jing Zhang. "An extended nonmonotone line search technique for large-scale unconstrained optimization." Journal of Computational and Applied Mathematics 330 (March 2018): 586–604. http://dx.doi.org/10.1016/j.cam.2017.09.026.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Hatamian, Masoud, Mahmoud Paripour, Farajollah Mohammadi Yaghoobi, and Nasrin Karamikabir. "An Adaptive Nonmonotone Line Search Technique for Solving Systems of Nonlinear Equations." Journal of Mathematics 2021 (August 26, 2021): 1–6. http://dx.doi.org/10.1155/2021/7134561.

Повний текст джерела

Анотація:

In this article, a new nonmonotone line search technique is proposed for solving a system of nonlinear equations. We attempt to answer this question how to control the degree of the nonmonotonicity of line search rules in order to reach a more efficient algorithm? Therefore, we present a novel algorithm that can avoid the increase of unsuccessful iterations. For this purpose, we show the robust behavior of the proposed algorithm by solving a few numerical examples. Under some suitable assumptions, the global convergence of our strategy is proved.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Zhu, Detong. "Trust Region Methods With Nonmonotonic Back Tracking Technique for." Optimization 46, no. 1 (1999): 81–113. http://dx.doi.org/10.1080/02331939908844445.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Ashok Kumar Ramadoss. "Prophecies using Physics Involved Neural Networks (PINNs) for achieving the accuracy using AI Models in discrete Kinematics." International Journal of Science and Research Archive 16, no. 1 (2025): 444–53. https://doi.org/10.30574/ijsra.2025.16.1.2043.

Повний текст джерела

Анотація:

Artificial Nonmonotonic Neural schema or Networks (ANNNs), a kind of hybrid learning systems that are capable of nonmonotonic reasoning. Nonmonotonic reasoning plays an important role in the development of artificial intelligent systems that try to mimic common sense reasoning, as exhibited by humans in slow and steady but the error is minimized unlike in monotonic where the decision is fast but with more errors. on the other hand, a hybrid learning system provides an explanation capability to trained Neural Networks through acquiring symbolic knowledge of a domain, refining it using a set of

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Dwail, Hasan H., and Mushtak A. K. Shiker. "Using a trust region method with nonmonotone technique to solve unrestricted optimization problem." Journal of Physics: Conference Series 1664 (November 2020): 012128. http://dx.doi.org/10.1088/1742-6596/1664/1/012128.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Wang, Hua, Chao Gu, and Dingguo Pu. "A BFGS trust-region method with a new nonmonotone technique for nonlinear equations." Optimization 64, no. 4 (2013): 981–92. http://dx.doi.org/10.1080/02331934.2013.840619.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Zhao, Lijuan. "Nonmonotone conic trust region method with line search technique for bound constrained optimization." RAIRO - Operations Research 53, no. 3 (2019): 787–805. http://dx.doi.org/10.1051/ro/2017054.

Повний текст джерела

Анотація:

In this paper, we propose a nonmonotone trust region method for bound constrained optimization problems, where the bounds are dealt with by affine scaling technique. Differing from the traditional trust region methods, the subproblem in our algorithm is based on a conic model. Moreover, when the trial point isn’t acceptable by the usual trust region criterion, a line search technique is used to find an acceptable point. This procedure avoids resolving the trust region subproblem, which may reduce the total computational cost. The global convergence and Q-superlinear convergence of the algorith

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Wang, Zhujun, and Detong Zhu. "A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization." Journal of Systems Science and Complexity 27, no. 3 (2014): 565–80. http://dx.doi.org/10.1007/s11424-014-1081-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Morgenstern, Leora. "Inheritance comes of age: applying nonmonotonic techniques to problems in industry." Artificial Intelligence 103, no. 1-2 (1998): 237–71. http://dx.doi.org/10.1016/s0004-3702(98)00073-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Zhao, Luyao, and Jingyong Tang. "LEVENBERG-MARQUARDT METHOD WITH A GENERAL LM PARAMETER AND A NONMONOTONE TRUST REGION TECHNIQUE." Journal of Applied Analysis & Computation 14, no. 4 (2024): 1959–76. http://dx.doi.org/10.11948/20220441.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

RAMAMOORTHY, C. V., DANIEL E. COOKE, and CHITTA BARAL. "MAINTAINING THE TRUTH OF SPECIFICATIONS IN EVOLUTIONARY SOFTWARE." International Journal on Artificial Intelligence Tools 02, no. 01 (1993): 15–31. http://dx.doi.org/10.1142/s0218213093000035.

Повний текст джерела

Анотація:

In this paper we explore how methods of truth maintenance and nonmonotonic reasoning may be applied in the engineering of integrated, dynamic systems. In the life of a large system, it is not possible to foresee every significant event which may affect the behavior of the system. Truth maintenance techniques may prove useful in the production and maintenance of these large systems. We discuss how it is that the decision making aspects of a system which change. Both the information on which we base our decisions and our strategies for decision making change. We discuss truth maintenance with re

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Zhu, Detong. "A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization." Journal of Computational and Applied Mathematics 136, no. 1-2 (2001): 73–97. http://dx.doi.org/10.1016/s0377-0427(00)00576-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Schlechta, Karl. "New techniques and completeness results for preferential structures." Journal of Symbolic Logic 65, no. 2 (2000): 719–46. http://dx.doi.org/10.2307/2586565.

Повний текст джерела

Анотація:

AbstractPreferential structures are probably the best examined semantics for nonmonotonic and deontic logics: in a wider sense, they also provide semantical approaches to theory revision and update, and other fields where a preference relation between models is a natural approach. They have been widely used to differentiate the various systems of such logics, and their construction is one of the main subjects in the formal investigation of these logics. We introduce new techniques to construct preferential structures for completeness proofs. Since our main interest is to provide general techni

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Mo, Jiangtao, Chunyan Liu, and Shicui Yan. "A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values." Journal of Computational and Applied Mathematics 209, no. 1 (2007): 97–108. http://dx.doi.org/10.1016/j.cam.2006.10.070.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Alekseev, A. M., A. M. Konstantinov, and A. V. Pavlov. "Integration of logical and imaginative thinking by Fourier holography techniques: Implementation in nonmonotonic reasoning." Bulletin of the Russian Academy of Sciences: Physics 71, no. 2 (2007): 169–74. http://dx.doi.org/10.3103/s1062873807020062.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

El-Sobky, Bothina, Yousria Abo-Elnaga, and Gehan Ashry. "A nonmonotone trust region technique with active-set and interior-point methods to solve nonlinearly constrained optimization problems." AIMS Mathematics 10, no. 2 (2025): 2509–40. https://doi.org/10.3934/math.2025117.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Li, Dan, and Detong Zhu. "An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization." International Journal of Computer Mathematics 95, no. 8 (2017): 1494–526. http://dx.doi.org/10.1080/00207160.2017.1329530.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Su, Ke, and Shibo Tang. "A MODIFIED SQP METHOD WITH NONMONOTONE LINE SEARCH TECHNIQUE WITHOUT A PENALTY OR A FILTER FOR NONLINEAR INEQUALITY CONSTRAINED OPTIMIZATION." Far East Journal of Applied Mathematics 95, no. 4 (2016): 249–64. http://dx.doi.org/10.17654/am095040249.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Wang, Yun-juan, and De-tong Zhu. "A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem." Applied Mathematics-A Journal of Chinese Universities 23, no. 4 (2008): 463–74. http://dx.doi.org/10.1007/s11766-008-1887-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Eiter, T., M. Fink, T. Krennwallner, C. Redl, and P. Schüller. "Efficient HEX-Program Evaluation Based on Unfounded Sets." Journal of Artificial Intelligence Research 49 (February 26, 2014): 269–321. http://dx.doi.org/10.1613/jair.4175.

Повний текст джерела

Анотація:

HEX-programs extend logic programs under the answer set semantics with external computations through external atoms. As reasoning from ground Horn programs with nonmonotonic external atoms of polynomial complexity is already on the second level of the polynomial hierarchy, minimality checking of answer set candidates needs special attention. To this end, we present an approach based on unfounded sets as a generalization of related techniques for ASP programs. The unfounded set detection is expressed as a propositional SAT problem, for which we provide two different encodings and optimizations

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Hammond, C. R., and G. E. Johnson. "The Method of Alternate Formulations, an Automated Strategy for Optimal Design." Journal of Mechanisms, Transmissions, and Automation in Design 110, no. 4 (1988): 459–63. http://dx.doi.org/10.1115/1.3258945.

Повний текст джерела

Анотація:

The Method of Alternate Formulations (MAF) is a new method of global information extraction for constrained, nonlinear optimization problems. MAF automatically generates the complete set of candidate solution points for these optimization problems using a symbolic mathematics computer package. MAF uses ideas and techniques from both the Method of Optimal Design and Monotonicity Analysis to reduce and formulate the problem. The reduced problem is repeatedly reformulated to develop state equations and objective functions in terms of all possible variable partitions. Trend analysis on the decisio

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Gautam, Arvind K., and Avinash Chandra. "A computational study of Stillinger–Weber silicon at 0.75 GPa in supercooled region." International Journal of Modern Physics B 32, no. 30 (2018): 1850330. http://dx.doi.org/10.1142/s0217979218503307.

Повний текст джерела

Анотація:

We studied the liquid-liquid transition in supercooled silicon modeled by the Stillinger–Weber potential. The Isothermal Isobaric Monte Carlo (NPT-MC) simulation techniques were performed here to compute the free energy difference between the two liquid phases of silicon by Bennett Acceptance Ratio (BAR) method along with a reversible path at 0.75 GPa pressure and 970 K temperature. The thermodynamic properties as energy ([Formula: see text]) and density ([Formula: see text]) of the high-density liquid (HDL) phase have been computed here at different temperatures from 970–990 K. We also comput

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Wang, Peng, and Detong Zhu. "A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity." International Journal of Computer Mathematics 96, no. 4 (2018): 663–91. http://dx.doi.org/10.1080/00207160.2018.1517208.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

EITER, THOMAS, MICHAEL FINK, THOMAS KRENNWALLNER, and CHRISTOPH REDL. "Conflict-driven ASP solving with external sources." Theory and Practice of Logic Programming 12, no. 4-5 (2012): 659–79. http://dx.doi.org/10.1017/s1471068412000233.

Повний текст джерела

Анотація:

AbstractAnswer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information,hex-programs extend programs withexternal atoms, which allow for a bidirectional communication between the logic program and external sources of computation (e.g., description logic reasoners and Web resources). Current solvers evaluatehex-programs by a translation to ASP itself, in which values of external atoms are guessed and verified after the ordinary answer set computation. This elegant approach does not scale w

Стилі APA, Harvard, Vancouver, ISO та ін.

49

A.R., Zhangozha. "On techniques of expert systems on the example of the Akinator program." Artificial Intelligence 25, no. 2 (2020): 7–13. http://dx.doi.org/10.15407/jai2020.02.007.

Повний текст джерела

Анотація:

On the example of the online game Akinator, the basic principles on which programs of this type are built are considered. Effective technics have been proposed by which artificial intelligence systems can build logical inferences that allow to identify an unknown subject from its description (predicate). To confirm the considered hypotheses, the terminological analysis of definition of the program "Akinator" offered by the author is carried out. Starting from the assumptions given by the author's definition, the article complements their definitions presented by other researchers and analyzes

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Walhorn, Volker, Jan Paskarbeit, Heinrich Gotthard Frey, Alexander Harder, and Dario Anselmetti. "Distance dependence of near-field fluorescence enhancement and quenching of single quantum dots." Beilstein Journal of Nanotechnology 2 (September 29, 2011): 645–52. http://dx.doi.org/10.3762/bjnano.2.68.

Повний текст джерела

Анотація:

In fluorescence microscopy and spectroscopy, energy transfer processes between single fluorophores and fluorophore quencher pairs play an important role in the investigation of molecular distances or orientations. At distances larger than about 3 nm these effects originate predominantly from dipolar coupling. As these experiments are commonly performed in homogenous media, effects at the interface boundaries can be neglected. Nevertheless, the combination of such assays with single-molecule manipulation techniques such as atomic force microscopy (AFM) requires a detailed understanding of the i

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!