派博傳思國際中心

標(biāo)題: Titlebook: Learning and Intelligent Optimization; 4th International Co Christian Blum,Roberto Battiti Conference proceedings 2010 Springer-Verlag Berl [打印本頁]

作者: CLIP 時間: 2025-3-21 18:25
書目名稱Learning and Intelligent Optimization影響因子(影響力)

書目名稱Learning and Intelligent Optimization影響因子(影響力)學(xué)科排名

書目名稱Learning and Intelligent Optimization網(wǎng)絡(luò)公開度

書目名稱Learning and Intelligent Optimization網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Learning and Intelligent Optimization被引頻次

書目名稱Learning and Intelligent Optimization被引頻次學(xué)科排名

書目名稱Learning and Intelligent Optimization年度引用

書目名稱Learning and Intelligent Optimization年度引用學(xué)科排名

書目名稱Learning and Intelligent Optimization讀者反饋

書目名稱Learning and Intelligent Optimization讀者反饋學(xué)科排名

作者: 季雨 時間: 2025-3-21 21:59

作者: 反省 時間: 2025-3-22 03:53
A Parallel Multi-Objective Evolutionary Algorithm for Phylogenetic Inferenceobjective approach used the maximum parsimony (MP) and maximum likelihood (ML) as optimality criteria [5]. The proposed multi-objective evolutionary algorithm (MOEA) [6], called PhyloMOEA, produces a set of distinct solutions representing a trade-off between the considered objectives. In this paper,

作者: 織物 時間: 2025-3-22 07:42

作者: paleolithic 時間: 2025-3-22 09:22
André G. dos Santos,Rodolfo P. Araujo,José E. C. Arroyo assets to the legal extent possible. ..Explains when and how to play hardball.? . . Nearly a million people get divorced each year in the United States. Many, if not most, could be handled far better for all p978-1-4302-5716-5978-1-4302-5717-2

作者: 散布 時間: 2025-3-22 16:52

作者: CURB 時間: 2025-3-22 18:57
Waldo Cancino,Laetitia Jourdan,El-Ghazali Talbi,Alexandre C. B. Delbem

作者: 大喘氣 時間: 2025-3-23 00:46
Marco Caserta,Stefan Vo?s you and your spouse decide what’s best for the children. ..Shows you how to protect your assets to the legal extent possible. ..Explains when and how to play hardball.? . . Nearly a million people get divorced each year in the United States. Many, if not most, could be handled far better for all p

作者: 淘氣 時間: 2025-3-23 03:13
Stefano Benedettini,Christian Blum,Andrea Rolis you and your spouse decide what’s best for the children. ..Shows you how to protect your assets to the legal extent possible. ..Explains when and how to play hardball.? . . Nearly a million people get divorced each year in the United States. Many, if not most, could be handled far better for all p

作者: GLIB 時間: 2025-3-23 06:51

作者: Expediency 時間: 2025-3-23 12:44
A Combination of Evolutionary Algorithm, Mathematical Programming, and a New Local Search Procedure l earliness and tardiness costs. The experimental results with instances from the literature show the efficiency of the proposed hybrid method: it was able to improve the known upper bound for most of the instances tested, in very little computational time.

作者: 敬禮 時間: 2025-3-23 17:41

作者: Abrade 時間: 2025-3-23 20:47

作者: CRAB 時間: 2025-3-24 01:27

作者: 媽媽不開心 時間: 2025-3-24 04:28

作者: 松果 時間: 2025-3-24 10:11

作者: ICLE 時間: 2025-3-24 12:33

作者: Acetaminophen 時間: 2025-3-24 16:24
Generative Topographic Mapping for Dimension Reduction in Engineering Designtransforms the high dimensional data space to a low dimensional one. Hence there is no risk of missing out on information relating to any variables during the dimension reduction. The method is demonstrated using the two dimensional Branin function and applied to a problem in wing design.

作者: crucial 時間: 2025-3-24 22:25

作者: conscribe 時間: 2025-3-25 00:19
Learning of Highly-Filtered Data Manifold Using Spectral Methodsoach is relevant in the general field of manifold learning, as a tool for approximating the response of the models based on many parameters. Our experiments show that the approach is at least competitive with other latent factor prediction methods, and that the precision of prediction grows with the increase in the order of the polynomial basis.

作者: Blazon 時間: 2025-3-25 04:44
Adaptive “Anytime” Two-Phase Local Searchroblems for the bi-objective case. In particular, we propose two weight setting strategies that show better anytime search characteristics than the original weight setting strategy used in the TPLS algorithm.

作者: BYRE 時間: 2025-3-25 09:23

作者: ALIBI 時間: 2025-3-25 14:33

作者: 眨眼 時間: 2025-3-25 17:07

作者: 變量 時間: 2025-3-25 21:17
Adaptive “Anytime” Two-Phase Local Searchquence of single-objective ones by means of weighted sum aggregations. This paper studies different sequences of weights for defining the aggregated problems for the bi-objective case. In particular, we propose two weight setting strategies that show better anytime search characteristics than the or

作者: 連鎖 時間: 2025-3-26 03:47
Adaptive Filter SQPjor innovation in this work. The resulting algorithm can deal with constraints involving different length scales without requiring their normalization. The effort related to gradients computation is compensated by achieving superlinear local convergence rate (under some hypothesis on the problem, th

作者: SLING 時間: 2025-3-26 05:01
Algorithm Selection as a Bandit Problem with Unbounded Lossespensive. In recent work, we adopted an . approach, in which a performance model is iteratively updated and used to guide selection on a sequence of problem instances. The resulting . trade-off was represented as a bandit problem with expert advice, using an existing solver for this game, but this re

作者: Restenosis 時間: 2025-3-26 08:47

作者: AVOW 時間: 2025-3-26 13:14

作者: Dna262 時間: 2025-3-26 19:09
Distance Functions, Clustering Algorithms and Microarray Data Analysisrray data. In the general data mining and classification literature, functions such as Euclidean distance or Pearson correlation have gained their status of . standards thanks to a considerable amount of experimental validation. For microarray data, the issue of which distance function “works best”

作者: LARK 時間: 2025-3-26 21:07

作者: AMEND 時間: 2025-3-27 02:28

作者: Gudgeon 時間: 2025-3-27 06:42

作者: 分期付款 時間: 2025-3-27 12:05
A Linear Approximation of the Value Function of an Approximate Dynamic Programming Approach for the alue function in the set partitioning problem. The decision problem is a modification of the set partitioning problem so that it can be solved by the route generation approach. Numerical results for evaluating this approach is also given.

作者: Original 時間: 2025-3-27 17:01

作者: 蛙鳴聲 時間: 2025-3-27 21:41
A Network Approach for Restructuring the Korean Freight Railway Considering Customer Behaviore model is designed to support decision-making on capacity expansion of rail terminals in order to minimize demand loss during restructuring. A network based approximation technique is presented to handle customer behavior on demand loss.

作者: 不愿 時間: 2025-3-27 22:20

作者: 讓空氣進入 時間: 2025-3-28 03:17
Convergence of Probability Collectives with Adaptive Choice of Temperature Parameters[4] where agents should coordinate to achieve a common goal. In most of these cases a centralized solution is inefficient because of the scale and the complexity of the problems and thus distributed solutions are required.

作者: Foment 時間: 2025-3-28 09:34
Generative Topographic Mapping for Dimension Reduction in Engineering Designl burden caused by this ‘curse of dimensionality’ can be avoided by reducing the dimension of the problem. This work describes a dimension reduction method called generative topographic mapping. Unlike the earlier practice of removing irrelevant design variables for dimension reduction, this method

作者: 儀式 時間: 2025-3-28 11:08

作者: 爭吵 時間: 2025-3-28 16:25

作者: Duodenitis 時間: 2025-3-28 22:13

作者: Outmoded 時間: 2025-3-28 23:37

作者: 比賽用背帶 時間: 2025-3-29 06:17

作者: CROAK 時間: 2025-3-29 08:58
https://doi.org/10.1007/978-3-642-13800-3algorithms; evolutionary algorithm; evolutionary algorithms; heuristic search; learning; metaheuristic; op

作者: 增長 時間: 2025-3-29 14:55
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/582898.jpg

作者: addict 時間: 2025-3-29 15:49