標(biāo)題: Titlebook: Approximation and Optimization; Algorithms, Complexi Ioannis C. Demetriou,Panos M. Pardalos Book 2019 Springer Nature Switzerland AG 2019 R [打印本頁] 作者: Spring 時間: 2025-3-21 16:48
書目名稱Approximation and Optimization影響因子(影響力)
書目名稱Approximation and Optimization影響因子(影響力)學(xué)科排名
書目名稱Approximation and Optimization網(wǎng)絡(luò)公開度
書目名稱Approximation and Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation and Optimization被引頻次
書目名稱Approximation and Optimization被引頻次學(xué)科排名
書目名稱Approximation and Optimization年度引用
書目名稱Approximation and Optimization年度引用學(xué)科排名
書目名稱Approximation and Optimization讀者反饋
書目名稱Approximation and Optimization讀者反饋學(xué)科排名
作者: 熒光 時間: 2025-3-21 20:19
Tax Evasion as an Optimal Solution to a Partially Observable Markov Decision Process,also compute the effect on firm behavior of any extensions of the statute of limitations within which the firm’s tax filings can be audited, and show that such extensions can be a significant deterrent against tax evasion.作者: 象形文字 時間: 2025-3-22 01:54 作者: hemoglobin 時間: 2025-3-22 07:37 作者: calorie 時間: 2025-3-22 12:46 作者: 自戀 時間: 2025-3-22 16:21
Book 2019data; binary sequences; design of networks and energy systems; fuzzy control; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy..作者: Hypomania 時間: 2025-3-22 17:36
A. Czerny,Fr. Müller,A. Schittenhelm. A new surprising phenomenon is observed for large scale portfolio optimization: efficiency of obtained optimal portfolio is biased with respect to the true optimal portfolio. Different aspects of this phenomenon and possible ways to reduce its negative effect are discussed.作者: HEPA-filter 時間: 2025-3-23 00:22
https://doi.org/10.1007/978-3-642-90691-6options and methods which can be used for the fine-tuning of the parameters of the system. The main concept of the present chapter is to provide stimuli to those who deal with design, optimization, and control issues on smart structures.作者: 賞心悅目 時間: 2025-3-23 03:30
Impact of Error in Parameter Estimations on Large Scale Portfolio Optimization,. A new surprising phenomenon is observed for large scale portfolio optimization: efficiency of obtained optimal portfolio is biased with respect to the true optimal portfolio. Different aspects of this phenomenon and possible ways to reduce its negative effect are discussed.作者: 法官 時間: 2025-3-23 05:32 作者: dragon 時間: 2025-3-23 12:49
1931-6828 tion.Highlights new research results.This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading experts and reflect emerging directions and connections in data approximation and optimization. Chapters disc作者: Monocle 時間: 2025-3-23 14:55
F. Kraus,O. Minkowski,A. Schittenhelmest model for a given task. In this paper, recent multi-objective evolutionary approaches for four major data mining and machine learning tasks, namely: (a) data preprocessing, (b) classification, (c) clustering, and (d) association rules, are surveyed.作者: 饒舌的人 時間: 2025-3-23 21:18
Multi-Objective Evolutionary Optimization Algorithms for Machine Learning: A Recent Survey,est model for a given task. In this paper, recent multi-objective evolutionary approaches for four major data mining and machine learning tasks, namely: (a) data preprocessing, (b) classification, (c) clustering, and (d) association rules, are surveyed.作者: refine 時間: 2025-3-23 22:13 作者: 滴注 時間: 2025-3-24 02:50
,Die paraprotein?mischen H?moblastosen,artis et al. (SIAM J. Numer. Anal. 53:836–851, 2015) for the general nonconvex case involving both equality and inequality constraints can be generalized to yield a bound of . evaluations under similarly weakened assumptions.作者: SIT 時間: 2025-3-24 07:27
https://doi.org/10.1007/978-3-642-94558-8f this paper is to go through the main research efforts that contributed to this research field, reveal the main issues, and disclose those points that are helpful in understanding the hypotheses, the restrictions, or even the inability of applying No Free Lunch theorems.作者: 甜食 時間: 2025-3-24 11:13
https://doi.org/10.1007/978-3-642-94558-8ucted in only . operations. A new algorithm for doing this is developed and its effectiveness is proved. Some results of applying it to undulating and peaky data are presented, showing that it is fast and can give very good results, particularly for large densely packed data, even when the errors are quite large.作者: CHAR 時間: 2025-3-24 18:51 作者: 孵卵器 時間: 2025-3-24 19:38
No Free Lunch Theorem: A Review,f this paper is to go through the main research efforts that contributed to this research field, reveal the main issues, and disclose those points that are helpful in understanding the hypotheses, the restrictions, or even the inability of applying No Free Lunch theorems.作者: Slit-Lamp 時間: 2025-3-25 02:24 作者: 裝飾 時間: 2025-3-25 06:35
Recent Progress in Optimization of Multiband Electrical Filters,ty. We discuss a recently developed approach for the solution of optimization problem naturally arising in the synthesis of multi-band (analogue, digital or microwave) electrical filters. The approach is based on techniques from algebraic geometry and generalizes the effective representation of Zolotar?v fraction.作者: MILL 時間: 2025-3-25 11:00 作者: 正常 時間: 2025-3-25 13:59
Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditi al. (IMA J Numer Anal 32:1662–1695, 2012) for computing an .-approximate first-order critical point can be obtained under significantly weaker assumptions. Moreover, the result is generalized to the case where high-order derivatives are used, resulting in a bound of .(..) evaluations whenever deriv作者: fertilizer 時間: 2025-3-25 19:07
Data-Dependent Approximation in Social Computing,ecially in the area of social computing, where nonsubmodular combinatorial optimization problems have been recently formulated. In this chapter, we present some theoretical results on the data-dependent approximation approach. In addition, some related open problems are discussed.作者: 手銬 時間: 2025-3-25 21:07 作者: crutch 時間: 2025-3-26 01:39 作者: arthroscopy 時間: 2025-3-26 07:14
,Piecewise Convex–Concave Approximation in the Minimax Norm,lowing projective technique is proposed for obtaining a vector of smooth approximations to these values. Find . minimizing ∥.??.∥. subject to the constraints that the consecutive second-order divided differences of the components of . change sign at most . times. This optimization problem (which is 作者: Longitude 時間: 2025-3-26 11:22
A Decomposition Theorem for the Least Squares Piecewise Monotonic Data Approximation Problem,condition that the first differences of the approximated values have at most .???1 sign changes, where . is a given positive integer. The positions of the sign changes are integer variables whose optimal values are to be determined automatically. Since the number of trials of all possible combinatio作者: 善變 時間: 2025-3-26 15:11
Recent Progress in Optimization of Multiband Electrical Filters,rogress in math eventually led to the progress in technology: half a century later German electrical engineer and physicist W. Cauer on the basis of this solution has invented low- and high-pass electrical filters known today as elliptic or Cauer-Zolotar?v filters and possessing the unbeatable quali作者: Narrative 時間: 2025-3-26 18:19
Impact of Error in Parameter Estimations on Large Scale Portfolio Optimization, risks. One fundamental approach for quantifying the risk–return trade-off of assets is mean–variance analysis. In this case, it is crucial to accurately estimate parameters of the model. We examine how estimation error for means and covariance matrix of stock returns may affect the results of selec作者: 拋媚眼 時間: 2025-3-27 00:19 作者: NOT 時間: 2025-3-27 01:16 作者: gangrene 時間: 2025-3-27 06:35 作者: 打算 時間: 2025-3-27 09:58
978-3-030-12769-5Springer Nature Switzerland AG 2019作者: 吸氣 時間: 2025-3-27 16:58
Ioannis C. Demetriou,Panos M. PardalosPresents approximation-related algorithms and their relevant applications.Contains new approaches and techniques to data-dependent approximation.Highlights new research results作者: 事物的方面 時間: 2025-3-27 20:17 作者: 急急忙忙 時間: 2025-3-27 23:14
Data-Dependent Approximation in Social Computing,ecially in the area of social computing, where nonsubmodular combinatorial optimization problems have been recently formulated. In this chapter, we present some theoretical results on the data-dependent approximation approach. In addition, some related open problems are discussed.作者: mortgage 時間: 2025-3-28 02:44
https://doi.org/10.1007/978-3-642-94983-8A brief survey is given to the papers of this volume that explore various aspects of approximation and optimization.作者: Alcove 時間: 2025-3-28 08:44
Introduction,A brief survey is given to the papers of this volume that explore various aspects of approximation and optimization.作者: Platelet 時間: 2025-3-28 13:42
Approximation and Optimization978-3-030-12767-1Series ISSN 1931-6828 Series E-ISSN 1931-6836 作者: Amylase 時間: 2025-3-28 15:42
Die einheimische Ruhr im Kindesalter,ecially in the area of social computing, where nonsubmodular combinatorial optimization problems have been recently formulated. In this chapter, we present some theoretical results on the data-dependent approximation approach. In addition, some related open problems are discussed.作者: Ambulatory 時間: 2025-3-28 22:33
,Die paraprotein?mischen H?moblastosen, al. (IMA J Numer Anal 32:1662–1695, 2012) for computing an .-approximate first-order critical point can be obtained under significantly weaker assumptions. Moreover, the result is generalized to the case where high-order derivatives are used, resulting in a bound of .(..) evaluations whenever deriv作者: 濕潤 時間: 2025-3-29 00:41 作者: SYN 時間: 2025-3-29 03:31
F. Kraus,O. Minkowski,A. Schittenhelmptimization assists machine learning algorithms to optimize their hyper-parameters, usually under conflicting performance objectives and selects the best model for a given task. In this paper, recent multi-objective evolutionary approaches for four major data mining and machine learning tasks, namel作者: intolerance 時間: 2025-3-29 10:23 作者: conspicuous 時間: 2025-3-29 12:03
https://doi.org/10.1007/978-3-642-94558-8lowing projective technique is proposed for obtaining a vector of smooth approximations to these values. Find . minimizing ∥.??.∥. subject to the constraints that the consecutive second-order divided differences of the components of . change sign at most . times. This optimization problem (which is 作者: 對待 時間: 2025-3-29 19:33
https://doi.org/10.1007/978-3-642-94604-2condition that the first differences of the approximated values have at most .???1 sign changes, where . is a given positive integer. The positions of the sign changes are integer variables whose optimal values are to be determined automatically. Since the number of trials of all possible combinatio作者: miracle 時間: 2025-3-29 20:09
https://doi.org/10.1007/978-3-642-94604-2rogress in math eventually led to the progress in technology: half a century later German electrical engineer and physicist W. Cauer on the basis of this solution has invented low- and high-pass electrical filters known today as elliptic or Cauer-Zolotar?v filters and possessing the unbeatable quali作者: ENDOW 時間: 2025-3-30 02:49
