標題: Titlebook: Computational Science and Its Applications - ICCSA 2011; International Confer Beniamino Murgante,Osvaldo Gervasi,Bernady O. Apdu Conference [打印本頁] 作者: Baleful 時間: 2025-3-21 16:45
書目名稱Computational Science and Its Applications - ICCSA 2011影響因子(影響力)
書目名稱Computational Science and Its Applications - ICCSA 2011影響因子(影響力)學科排名
書目名稱Computational Science and Its Applications - ICCSA 2011網絡公開度
書目名稱Computational Science and Its Applications - ICCSA 2011網絡公開度學科排名
書目名稱Computational Science and Its Applications - ICCSA 2011被引頻次
書目名稱Computational Science and Its Applications - ICCSA 2011被引頻次學科排名
書目名稱Computational Science and Its Applications - ICCSA 2011年度引用
書目名稱Computational Science and Its Applications - ICCSA 2011年度引用學科排名
書目名稱Computational Science and Its Applications - ICCSA 2011讀者反饋
書目名稱Computational Science and Its Applications - ICCSA 2011讀者反饋學科排名
作者: Valves 時間: 2025-3-21 22:19 作者: FLUSH 時間: 2025-3-22 01:39 作者: Adrenal-Glands 時間: 2025-3-22 06:56 作者: Genistein 時間: 2025-3-22 12:04 作者: 易彎曲 時間: 2025-3-22 15:58 作者: 易彎曲 時間: 2025-3-22 19:00
-Enclosing Axis-Parallel SquareLet . be a set of . points in the plane. Here we present an efficient algorithm to compute the smallest square containing at least . points of . for large values of .. The worst case time complexity of the algorithm is .(.?+?(.???.)log. (.???.)) using .(.) space which is the best known bound for worst case time complexity.作者: 低三下四之人 時間: 2025-3-23 00:57
Min-Density Stripe Covering and Applications in Sensor NetworksA problem of min-density covering of a stripe by the disks of one, two and three radii is considered. New regular covers are proposed and studied. The developed methods and the obtained results are important theoretically and may be used as a tool for power-efficient monitoring of lengthy objects by sensor networks.作者: 打包 時間: 2025-3-23 03:24
Power Diagrams and Intersection DetectionWe propose a new algorithm for the detection of all intersections between a set of balls and a general query object. The proposed algorithm does not impose any restrictive condition on the set of balls and utilises power diagrams to minimize the amount of intersection tests. The price for this is power diagram computation in a preprocessing step.作者: 修正案 時間: 2025-3-23 07:42 作者: packet 時間: 2025-3-23 11:15
https://doi.org/10.1007/978-3-319-47792-3herein proposed heuristic pattern search method combines the Hooke and Jeeves (HJ) pattern and exploratory moves with a randomly generated approximate descent direction. Two versions of the heuristic algorithm have been applied to several benchmark minimax problems and compared with the original HJ pattern search algorithm.作者: 喃喃而言 時間: 2025-3-23 17:16 作者: 中子 時間: 2025-3-23 19:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232954.jpg作者: 極少 時間: 2025-3-24 02:12 作者: LEVER 時間: 2025-3-24 05:36
Surface inhomogeneities on late-type stars, are given for the problems called hidden-line and hidden-surface removal in computer graphics. More precisely, algorithms are proposed to find the portions of the edges visible from (0,0,?∞?) and to find the upper envelope (i.e., the pointwise maximum) of the polygons. The proposed solution for the作者: 巧思 時間: 2025-3-24 09:03 作者: Coordinate 時間: 2025-3-24 13:24 作者: 繼承人 時間: 2025-3-24 17:54 作者: hankering 時間: 2025-3-24 20:27
Springer Tracts in Modern Physicsof research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with insightful new results found. On the other hand, as a作者: 粘連 時間: 2025-3-25 00:04
https://doi.org/10.1007/978-1-4684-2772-1rming a tree with labeled leaved into another one through contraction of inner vertices in presence of certain restrictions. We demonstrate that a possibility to contract non-adjacent vertices is sometimes crucial for the initial task..Next, we provide a linear algorithm for solving a relaxed proble作者: 腫塊 時間: 2025-3-25 04:49
https://doi.org/10.1007/978-1-4684-2772-1to-point links are established in the nodes of such networks using high gain directional antennas. Some nodes are directly linked to the wired internet, and the others link to these using a small number of hops..Minimization of system cost is an important objective in these networks, since generally作者: 長處 時間: 2025-3-25 09:58
https://doi.org/10.1007/978-1-4684-2772-1e-dimensional graph. This graph is given as a set of vertices together with their space Euclidean coordinates, and a set of edges connecting them. More precisely, the three-dimensional graph represents the approximation of a closed and smooth implicitly defined space algebraic curve, that allows us 作者: Feckless 時間: 2025-3-25 13:11 作者: Geyser 時間: 2025-3-25 19:38 作者: 陪審團每個人 時間: 2025-3-25 21:07 作者: BROTH 時間: 2025-3-26 01:59
https://doi.org/10.1007/978-981-16-3568-7ution accuracy and reduce computational costs, in particular the number of function evaluations. The modifications also focus on special point movements, such as the random, search and the leap movements. A local search is applied to refine promising regions. An extension to bound constrained proble作者: 衰弱的心 時間: 2025-3-26 05:15 作者: 枕墊 時間: 2025-3-26 11:19 作者: 拋射物 時間: 2025-3-26 14:57 作者: Distribution 時間: 2025-3-26 18:27 作者: FID 時間: 2025-3-26 23:39
An Optimal Hidden-Surface Algorithm and Its Parallelization are given for the problems called hidden-line and hidden-surface removal in computer graphics. More precisely, algorithms are proposed to find the portions of the edges visible from (0,0,?∞?) and to find the upper envelope (i.e., the pointwise maximum) of the polygons. The proposed solution for the作者: obsession 時間: 2025-3-27 04:41 作者: 名詞 時間: 2025-3-27 07:42 作者: BORE 時間: 2025-3-27 13:21 作者: 裂口 時間: 2025-3-27 15:29
A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Frécof research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with insightful new results found. On the other hand, as a作者: infarct 時間: 2025-3-27 19:37 作者: 倫理學 時間: 2025-3-28 01:35
Topology Construction for Rural Wireless Mesh Networks - A Geometric Approachto-point links are established in the nodes of such networks using high gain directional antennas. Some nodes are directly linked to the wired internet, and the others link to these using a small number of hops..Minimization of system cost is an important objective in these networks, since generally作者: SLING 時間: 2025-3-28 02:33
An Adapted Version of the Bentley-Ottmann Algorithm for Invariants of Plane Curves Singularitiese-dimensional graph. This graph is given as a set of vertices together with their space Euclidean coordinates, and a set of edges connecting them. More precisely, the three-dimensional graph represents the approximation of a closed and smooth implicitly defined space algebraic curve, that allows us 作者: 吞下 時間: 2025-3-28 10:09
A Heuristic Homotopic Path Simplification Algorithm, for a given error, the goal is to find a path with the minimum number of vertices while preserving the homotopy in presence of a given set of extra points in the plane. We present a heuristic method for homotopy-preserving simplification under any desired measure for general paths. Our algorithm f作者: 內閣 時間: 2025-3-28 12:10
An Improved Approximation Algorithm for the Terminal Steiner Tree Problemith all the vertices of . as its leaves. Then the terminal Steiner tree problem is to find a terminal Steiner tree in . with minimum length. In this paper, we present an approximation algorithm with performance ratio . for the terminal Steiner tree problem, where . is the best-known performance rati作者: stress-test 時間: 2025-3-28 18:19 作者: Minuet 時間: 2025-3-28 20:17 作者: probate 時間: 2025-3-29 00:58 作者: locus-ceruleus 時間: 2025-3-29 04:26
Influence of Sampling in Radiation Therapy Treatment Designnt planning. Large amounts of data are typically involved in radiation therapy optimization problems. Regardless the formulation used, the problem size is always the biggest challenge to overcome. The most common strategy to address this problem is sampling which may have a significant impact on the作者: Lumbar-Stenosis 時間: 2025-3-29 08:02
On Minimizing Objective and KKT Error in a Filter Line Search Strategy for an Interior Point MethodT) vector error in order to encourage global convergence of interior point methods. These filter strategies are implemented in an infeasible primal-dual interior point framework for nonlinear programming. First, we propose a filter that has four components measuring primal feasibility, complementari作者: STALL 時間: 2025-3-29 15:16
Computational Science and Its Applications - ICCSA 2011International Confer作者: 構成 時間: 2025-3-29 18:31
0302-9743 d planning; computational geometry and applications; computer aided modeling, simulation, and analysis; and mobile communications..978-3-642-21930-6978-3-642-21931-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Extemporize 時間: 2025-3-29 23:30 作者: fructose 時間: 2025-3-30 01:51 作者: Generic-Drug 時間: 2025-3-30 06:18 作者: 摘要 時間: 2025-3-30 08:21 作者: 微生物 時間: 2025-3-30 14:05
A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Frécctical method to align a pair of protein backbones, improving the previous method by Jiang et al. Finally, we present a greedy-and-backtrack method, using the new alignment method as a subroutine, to handle the CPS-3F problem. We also prove two simple lemmas, giving some evidence to why our new meth作者: 聚集 時間: 2025-3-30 17:14 作者: LAY 時間: 2025-3-31 00:04 作者: HACK 時間: 2025-3-31 02:29 作者: 小爭吵 時間: 2025-3-31 05:55 作者: CLIFF 時間: 2025-3-31 13:00 作者: Femish 時間: 2025-3-31 16:16 作者: 合法 時間: 2025-3-31 20:30 作者: 省略 時間: 2025-3-31 22:00 作者: Cloudburst 時間: 2025-4-1 05:26
An Improved Approximation Algorithm for the Terminal Steiner Tree Problemaper, we present an approximation algorithm with performance ratio . for the terminal Steiner tree problem, where . is the best-known performance ratio for the Steiner tree problem with any .?≥?2. When we let .?=?3.87?≈?4, this result improves the previous performance ratio of 2.515 to 2.458.作者: negotiable 時間: 2025-4-1 06:06 作者: VOK 時間: 2025-4-1 13:41
