標(biāo)題: Titlebook: Computational Science and Its Applications - ICCSA 2014; 14th International C Beniamino Murgante,Sanjay Misra,Osvaldo Gervasi Conference pr [打印本頁(yè)] 作者: 迅速 時(shí)間: 2025-3-21 17:24
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014影響因子(影響力)
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014影響因子(影響力)學(xué)科排名
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014被引頻次
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014被引頻次學(xué)科排名
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014年度引用
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014年度引用學(xué)科排名
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014讀者反饋
書(shū)目名稱Computational Science and Its Applications - ICCSA 2014讀者反饋學(xué)科排名
作者: COUCH 時(shí)間: 2025-3-21 20:24 作者: Aerate 時(shí)間: 2025-3-22 01:27 作者: 肉體 時(shí)間: 2025-3-22 06:30
IMRT Beam Angle Optimization Using Non-descent Pattern Search Methods of non-increasing iterates such that iterate progression is solely based on a finite number of function evaluations in each iteration, without explicit or implicit use of derivatives. Typically, in IMRT optimization, the quality of the solutions obtained is not simply related to the final value of 作者: 弄皺 時(shí)間: 2025-3-22 11:23 作者: sacrum 時(shí)間: 2025-3-22 15:15
IMRT Beam Angle Optimization Using DDS with a Cross-Validation Approach for Configuration Selectionlinical outcome. In clinical practice, the angles are usually chosen after a lengthy trial and error procedure that is significantly dependent on the planner’s experience and time availability. The use of optimization models and algorithms can be an important contribution to the treatment planning, 作者: sacrum 時(shí)間: 2025-3-22 18:43 作者: PUT 時(shí)間: 2025-3-22 22:54
Maximizing Expectation on Vertex-Disjoint Cycle Packingr arcs are subject to failure with a known probability. This method has an immediate practical application: it can be used for the solution of a kidney exchange program in the common situation where the underlying graph is unreliable. Results for realistic benchmark instances are reported and analyz作者: 易怒 時(shí)間: 2025-3-23 03:29 作者: Entirety 時(shí)間: 2025-3-23 07:37 作者: Enthralling 時(shí)間: 2025-3-23 11:24 作者: STERN 時(shí)間: 2025-3-23 17:38 作者: Pudendal-Nerve 時(shí)間: 2025-3-23 20:35
On Simplicial Longest Edge Bisection in Lipschitz Global Optimizationen the number of dimensions is greater than two, irregular simplices (not all edges have the same length) may appear with more than one longest edge. In these cases, the first longest edge is usually selected. We study the impact of other selection rule of the longest edge to be bisected next on the作者: 暴行 時(shí)間: 2025-3-23 22:57 作者: Compass 時(shí)間: 2025-3-24 04:34 作者: 令人心醉 時(shí)間: 2025-3-24 08:14
Branch and Bound Based Coordinate Search Filter Algorithm for Nonsmooth Nonconvex Mixed-Integer Nonlnd of problem appears in a wide range of real applications and is very difficult to solve. The difficulties are due to the nonlinearities of the functions in the problem and the integrality restrictions on some variables. When they are nonconvex then they are the most difficult to solve above all. W作者: Congestion 時(shí)間: 2025-3-24 12:58 作者: 外形 時(shí)間: 2025-3-24 17:22 作者: 一再遛 時(shí)間: 2025-3-24 19:44
On the Properties of General Dual-Feasible Functionsll the functions proposed in the literature are defined only for positive arguments, which restricts considerably their applicability. The characteristics and properties of dual-feasible functions with general domains remain mostly unknown. In this paper, we show that extending these functions to ne作者: 增減字母法 時(shí)間: 2025-3-24 23:10 作者: 深淵 時(shí)間: 2025-3-25 05:47 作者: Dri727 時(shí)間: 2025-3-25 08:24
Experiments with Firefly Algorithmta-heuristic algorithm that can be applied for solving the hardest optimization problems. The main goal of this paper is to analyze the influence of changing some parameters of the FA when solving bound constrained optimization problems. One of the most important aspects of this algorithm is how far作者: Ambulatory 時(shí)間: 2025-3-25 13:04 作者: 生氣的邊緣 時(shí)間: 2025-3-25 18:26 作者: HEDGE 時(shí)間: 2025-3-25 23:30 作者: 牙齒 時(shí)間: 2025-3-26 01:35 作者: BAIL 時(shí)間: 2025-3-26 06:14 作者: 熒光 時(shí)間: 2025-3-26 09:58
Acute Appendicitis During Pregnancy,ed subproblems at each node of the branch and bound tree search, an algorithm based on a multistart strategy with a coordinate search filter methodology is implemented. The produced numerical results show the robustness of the proposed methodology.作者: 表示問(wèn) 時(shí)間: 2025-3-26 12:50
Surgical Diseases of the Spleen. The knowledge of these properties is fundamental to derive good families of general maximal dual-feasible functions that might lead to strong cuts for integer linear optimization problems and strong lower bounds for combinatorial optimization problems with knapsack constraints.作者: 口訣 時(shí)間: 2025-3-26 16:47 作者: 假裝是我 時(shí)間: 2025-3-26 21:42
On Modelling Approaches for Planning and Scheduling in Food Processing Industrynce-dependent setups, non-triangular setups and product decay. We show that a trend exists towards so-called big bucket models. However, the advantage of these approaches may become a major obstacle in addressing the identified characteristics in FPI.作者: META 時(shí)間: 2025-3-27 01:40
A Multiobjective Approach for a Dynamic Simple Plant Location Problem under Uncertaintyssible future realizations of uncertainty. In this paper we consider a dynamic simple plant location problem, where uncertainty is explicitly considered through the use of scenarios. We advocate the use of a multiobjective approach as a valuable tool in guiding the decision-making process, iteratively or as an . generation procedure.作者: 多嘴 時(shí)間: 2025-3-27 07:22
Automatic Clustering Using a Genetic Algorithm with New Solution Encoding and Operatorstion as fitness function. Experimental validation shows that this new approach outperforms the classical clustering methods K-means and FCM. The method provides good results, and requires a small number of iterations to converge.作者: DEVIL 時(shí)間: 2025-3-27 12:33
Branch and Bound Based Coordinate Search Filter Algorithm for Nonsmooth Nonconvex Mixed-Integer Nonled subproblems at each node of the branch and bound tree search, an algorithm based on a multistart strategy with a coordinate search filter methodology is implemented. The produced numerical results show the robustness of the proposed methodology.作者: foppish 時(shí)間: 2025-3-27 15:57 作者: Robust 時(shí)間: 2025-3-27 21:12 作者: 國(guó)家明智 時(shí)間: 2025-3-27 23:38
On Simplicial Longest Edge Bisection in Lipschitz Global Optimization development of a branch-and-bound algorithm to solve multidimensional Lipschitz Global Optimization instances. Experiments show a significant reduction in the number of evaluated simplices for most of the test problems.作者: 招惹 時(shí)間: 2025-3-28 03:36
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular ,-Simt edge to be bisected such that the number of sub-simplices in the generated binary tree is minimal. The difficulty of this Combinatorial Optimization problem increases with .. Therefore, heuristics are studied that aim to minimize the number of generated simplices.作者: 歌曲 時(shí)間: 2025-3-28 07:45
Multiple Roots of Systems of Equations by Repulsion Merit Functionse the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.作者: 愛(ài)了嗎 時(shí)間: 2025-3-28 12:02
A Global Optimization Approach Applied to Structural Dynamic Updating solver previously used, in the updating of a structural dynamic model. The results show also that the . solver is more efficient than the ., since requires less computational effort to obtain the global solution.作者: gangrene 時(shí)間: 2025-3-28 14:55 作者: GUMP 時(shí)間: 2025-3-28 21:49
Conference proceedings 2014eviewed and selected from 1167. The 289 papers presented in the workshops cover various areas in computational science ranging from computational science technologies to specific areas of computational science such as computational geometry and security.作者: 獎(jiǎng)牌 時(shí)間: 2025-3-28 23:39 作者: Triglyceride 時(shí)間: 2025-3-29 03:10 作者: 金桌活畫(huà)面 時(shí)間: 2025-3-29 11:03 作者: 調(diào)整校對(duì) 時(shí)間: 2025-3-29 11:30
Pregnancy and Cardiac Prosthetic Valves,e the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.作者: 美食家 時(shí)間: 2025-3-29 16:31
D. D. Trunkey,Frieda Hulka,R. J. Mullins solver previously used, in the updating of a structural dynamic model. The results show also that the . solver is more efficient than the ., since requires less computational effort to obtain the global solution.作者: GOAD 時(shí)間: 2025-3-29 20:46
Surgical Disorders of the Peripheral Nervesf exchange cycles. Computational comparison of different variants of branch-and-price for the standard and the proposed objective functions are presented. The results show the efficiency of the proposed approach for solving large instances.作者: STELL 時(shí)間: 2025-3-30 02:04
0302-9743 Applications, ICCSA 2014, held in Guimar?es, Portugal, in June/July 2014. The 347 revised papers presented in 30 workshops and a special track were carefully reviewed and selected from 1167. The 289 papers presented in the workshops cover various areas in computational science ranging from computat作者: Fortify 時(shí)間: 2025-3-30 06:25
Bradley N. Reames,Timothy M. Pawlikion and the dynamic distribution of the resulting subdomains by the processors involved. Three PSSA-HeD variants were implemented and evaluated, with distinct limits on the recursive search depth, offering different levels of numerical and computational efficiency. Numerical results are presented and discussed.作者: 最初 時(shí)間: 2025-3-30 10:35
Surgical Diseases of the Spleendustrial process data. Some difficulties in the identification approach are pointed out and strategies to overcome them are suggested, namely the smoothing of discontinuity points. A simulation study demonstrates the application of the proposed technique.作者: 傲慢人 時(shí)間: 2025-3-30 12:50 作者: Spinous-Process 時(shí)間: 2025-3-30 18:19 作者: HEAVY 時(shí)間: 2025-3-30 23:59 作者: Distribution 時(shí)間: 2025-3-31 03:35 作者: AORTA 時(shí)間: 2025-3-31 07:18 作者: outer-ear 時(shí)間: 2025-3-31 11:43 作者: Insulin 時(shí)間: 2025-3-31 15:45
IMRT Beam Angle Optimization Using DDS with a Cross-Validation Approach for Configuration Selectionfinal outcome is strongly influenced by these choices. This motivated the use of a cross-validation based procedure for choosing the algorithm’s configuration, considering a set of ten retrospective treated cases of head-and-neck tumors at the Portuguese Institute of Oncology of Coimbra.作者: 特別容易碎 時(shí)間: 2025-3-31 21:27
Joint Scheduling and Optimal Charging of Electric Vehicles Problemium instances. A two-phase sequential heuristic, based on the Maximum Weight Clique Problem (MWCP) and the Minimum Cost Flow Problem (MCFP), is developed to solve large instances of the EVSCP. Computational results on a large set of real and randomly generated test instances show the efficiency and the effectiveness of the proposed approaches.作者: 傷心 時(shí)間: 2025-4-1 01:28 作者: 突變 時(shí)間: 2025-4-1 04:23 作者: Foreshadow 時(shí)間: 2025-4-1 09:06 作者: 未完成 時(shí)間: 2025-4-1 13:39
Hypertrophy of the Labia Minoralinical outcome. In clinical practice, the angles are usually chosen after a lengthy trial and error procedure that is significantly dependent on the planner’s experience and time availability. The use of optimization models and algorithms can be an important contribution to the treatment planning, 作者: PLAYS 時(shí)間: 2025-4-1 16:58
https://doi.org/10.1007/978-3-319-71712-8are selected followed by the fluence map optimization (FMO) considering those beam directions. The beam angle optimization (BAO) problem consists on the selection of appropriate radiation incidence directions in radiation therapy treatment planning and may be decisive for the quality of the treatmen作者: 無(wú)關(guān)緊要 時(shí)間: 2025-4-1 18:37
Conventional Mechanical Ventilation,r arcs are subject to failure with a known probability. This method has an immediate practical application: it can be used for the solution of a kidney exchange program in the common situation where the underlying graph is unreliable. Results for realistic benchmark instances are reported and analyz作者: 面包屑 時(shí)間: 2025-4-2 02:41
Michelle H. Scerbo M.D.,Laura J. Moore M.D. industry (FPI) reveals several specific characteristics which make integrated production planning and scheduling a challenge. First of all, setups are usually sequence-dependent and may include the so-called non-triangular setup conditions. Secondly, planning problems in FPI have to deal with produ作者: upstart 時(shí)間: 2025-4-2 06:25 作者: amygdala 時(shí)間: 2025-4-2 08:35
Oliver S. Soldes M.D., F.A.C.S., F.A.A.P.et of Electric Vehicles - EV and Combustion Engine Vehicles - CV, a set of tours to be processed by vehicles and a charging infrastructure, the problem aims to optimize the assignment of vehicles to tours and to minimize the charging cost of EVs while considering several operational constraints main
