標題: Titlebook: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies; First International Bo Chen,Mike Paterson,Guochuan Zhang Conferen [打印本頁] 作者: counterfeit 時間: 2025-3-21 17:19
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies影響因子(影響力)
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies影響因子(影響力)學科排名
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies網(wǎng)絡公開度
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies網(wǎng)絡公開度學科排名
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies被引頻次
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies被引頻次學科排名
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies年度引用
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies年度引用學科排名
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies讀者反饋
書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies讀者反饋學科排名
作者: Gentry 時間: 2025-3-21 21:08 作者: 金盤是高原 時間: 2025-3-22 04:22 作者: 主動 時間: 2025-3-22 05:26 作者: ATRIA 時間: 2025-3-22 10:57 作者: alcohol-abuse 時間: 2025-3-22 13:41
An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning,t bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level refinement algorithm based on swarm intelligence for bisecting graph. The success of our algorithm relies on exploiting both the swarm intelligence theory with 作者: alcohol-abuse 時間: 2025-3-22 17:57
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems,ths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also . disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the weighted Min-Sum Disjoint Paths problem is ..-compl作者: Minuet 時間: 2025-3-22 23:40
A Digital Watermarking Scheme Based on Singular Value Decomposition,hemes which are based on SVD (Singular Value Decomposition) are being developed in some literatures [1, 15] nowadays. All of these SVD-based watermarking schemes have good embedding quality and high robustness, but they must depend on an original image or store some extra tables to extract watermark作者: 原始 時間: 2025-3-23 02:17 作者: 不滿分子 時間: 2025-3-23 08:52
Clique-Transversal Sets in Cubic Graphs, the minimum cardinality of a clique-transversal set in .. In this paper we present an upper bound and a lower bound on ..(.) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp upper bound on ..(.) for claw-free cubic graphs.作者: 自負的人 時間: 2025-3-23 13:00
On the ,(,,,)-Labeling of Co-comparability Graphs, at least . apart, while vertices at distance at most 2 receive labels at least . apart. The goal of the .(.,.)-labeling problem is to produce a legal labeling that minimizes the largest label used. Since the decision version of the .(.,.)-labeling problem is NP-complete, it is important to investig作者: Cupping 時間: 2025-3-23 17:30 作者: consolidate 時間: 2025-3-23 20:20
Extending the Hardness of RNA Secondary Structure Comparison,olecule folding and identification of a function common to a set of molecules. Lin .?[6] proposed to define a similarity criterion between RNA structures using a concept of edit distance?; they named the corresponding problem .. Recently, Blin .?[3] showed that another problem, the . problem (or .),作者: Observe 時間: 2025-3-23 22:28 作者: arsenal 時間: 2025-3-24 04:54 作者: Jogging 時間: 2025-3-24 09:00 作者: optional 時間: 2025-3-24 12:19
Constrained Cycle Covers in Halin Graphs,cted) vertex is in at least one cycle. This problem arises in the design fiber-optic telecommunication networks which employ a set of rings covering the network. Besides two types of minimum weight cycle cover problem, we also settle the problem of covering Halin graphs with an optimal 2-edge-connec作者: Fermentation 時間: 2025-3-24 16:56 作者: exostosis 時間: 2025-3-24 19:36
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection,, such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. In this paper, we first show that bin packing with rejection can be reduced to . multiple knapsack problems. Then, based on techniques for the multiple knapsack problem we give a fast asymptotic polyn作者: 險代理人 時間: 2025-3-25 00:49
https://doi.org/10.1007/978-981-19-2277-0is always packed into the first bin where it fits. For an instance . let .(.) and .(.) denote the number of the used bins by algorithm FFD, and an optimal algorithm, respectively. We show in this paper that .and that this bound is tight. The tight bound of the additive constant was an open question 作者: Occlusion 時間: 2025-3-25 06:20
I. V. Ravi Kumar,G. Rajitha,B. Nancharaiahthe goal is to pack these into as few bins as possible of smallest possible size. In the classical problem the bin size vector is given and the sequence can be partitioned arbitrarily. We study a variation where the vectors have to be packed in the order in which they arrive and the bin size vector 作者: HUSH 時間: 2025-3-25 08:13 作者: 代理人 時間: 2025-3-25 12:45 作者: 平息 時間: 2025-3-25 17:19
Atsuo Hazeyama,Kiichi Furukawa,Yuki Yamadading approximate frequent items and approximate .-quantiles, estimating inner-products, constructing near-optimal .-bucket histograms and estimating entropy. We also present improved lower bound results for several problems over update data streams.作者: epidermis 時間: 2025-3-25 21:31
Atsuo Hazeyama,Kiichi Furukawa,Yuki Yamadat bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level refinement algorithm based on swarm intelligence for bisecting graph. The success of our algorithm relies on exploiting both the swarm intelligence theory with 作者: 似少年 時間: 2025-3-26 01:09 作者: BLUSH 時間: 2025-3-26 06:18
https://doi.org/10.1007/978-981-16-9101-0hemes which are based on SVD (Singular Value Decomposition) are being developed in some literatures [1, 15] nowadays. All of these SVD-based watermarking schemes have good embedding quality and high robustness, but they must depend on an original image or store some extra tables to extract watermark作者: 使乳化 時間: 2025-3-26 10:42
https://doi.org/10.1007/978-3-031-37216-2which is an ideal perfect secure. The other two schemes add the restricted order structure to the set of shadows and the access structure of secret sharing policy. The basis of the access structure of one scheme allows that only subsets that contain consecutive shadows can compute the broken secret,作者: Limousine 時間: 2025-3-26 14:27
,Der Investmentguide für smarte Investoren, the minimum cardinality of a clique-transversal set in .. In this paper we present an upper bound and a lower bound on ..(.) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp upper bound on ..(.) for claw-free cubic graphs.作者: 混雜人 時間: 2025-3-26 17:26
Die inverse Gutenberg-Revolution, at least . apart, while vertices at distance at most 2 receive labels at least . apart. The goal of the .(.,.)-labeling problem is to produce a legal labeling that minimizes the largest label used. Since the decision version of the .(.,.)-labeling problem is NP-complete, it is important to investig作者: judicial 時間: 2025-3-27 00:26
,Der ?Homo Zappiens“ ist im Vormarsch,?. such that .(.)?≤?.(1?+?.). and .(.)?≥?(1???.)./. or correctly decides that {.?∈?.|.(.)?≤?., .(.)?≥?.}?=??. Here .,. are vectors of .?≥?2 convex and concave functions, respectively, which are nonnegative on the convex compact set ??≠?.????.; . can be queried by a feasibility oracle or ., ., . and 作者: freight 時間: 2025-3-27 04:55
Elisabetta Basilico,Tommi Johnsenolecule folding and identification of a function common to a set of molecules. Lin .?[6] proposed to define a similarity criterion between RNA structures using a concept of edit distance?; they named the corresponding problem .. Recently, Blin .?[3] showed that another problem, the . problem (or .),作者: ALT 時間: 2025-3-27 06:47 作者: 吊胃口 時間: 2025-3-27 12:24 作者: enfeeble 時間: 2025-3-27 16:20
Elisabetta Basilico,Tommi Johnsen,.), where each link . in . can be traveled using time . . in a prespecified interval [. .,. .] while taking risk ., the . is to find a path in . from source to destination, together with an assignment of travel times along each link on the path, so that the total travel time of the path is no more 作者: 畏縮 時間: 2025-3-27 17:51 作者: muscle-fibers 時間: 2025-3-27 22:06 作者: 敘述 時間: 2025-3-28 06:07
D. J. van Niekerk,K. Kruger,A. H. Basson, such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. In this paper, we first show that bin packing with rejection can be reduced to . multiple knapsack problems. Then, based on techniques for the multiple knapsack problem we give a fast asymptotic polyn作者: Fabric 時間: 2025-3-28 08:57
https://doi.org/10.1007/978-3-540-74450-4Microarray; Multimedia; algebraic computation; algorithms; complexity; computational biology; data compres作者: myocardium 時間: 2025-3-28 12:26 作者: 形容詞 時間: 2025-3-28 18:34
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies978-3-540-74450-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: finale 時間: 2025-3-28 21:54
0302-9743 Overview: 978-3-540-74449-8978-3-540-74450-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 冷漠 時間: 2025-3-28 23:28
https://doi.org/10.1007/978-981-19-2277-0is always packed into the first bin where it fits. For an instance . let .(.) and .(.) denote the number of the used bins by algorithm FFD, and an optimal algorithm, respectively. We show in this paper that .and that this bound is tight. The tight bound of the additive constant was an open question for many years.作者: 桉樹 時間: 2025-3-29 06:50
Atsuo Hazeyama,Kiichi Furukawa,Yuki Yamadading approximate frequent items and approximate .-quantiles, estimating inner-products, constructing near-optimal .-bucket histograms and estimating entropy. We also present improved lower bound results for several problems over update data streams.作者: 貪婪的人 時間: 2025-3-29 10:13
,Der Investmentguide für smarte Investoren, the minimum cardinality of a clique-transversal set in .. In this paper we present an upper bound and a lower bound on ..(.) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp upper bound on ..(.) for claw-free cubic graphs.作者: ostensible 時間: 2025-3-29 15:18
Elisabetta Basilico,Tommi Johnsensibility of being futile and futility boundaries are specified. We apply this approach in banking default risk modeling monitoring to solve the optimal pairing ratio problem. Its effectiveness and efficiency are demonstrated by comparison with testing approach which is currently prevailing in banking models validation.作者: 情感 時間: 2025-3-29 17:14 作者: PANIC 時間: 2025-3-29 23:06 作者: aquatic 時間: 2025-3-30 00:19 作者: 怒目而視 時間: 2025-3-30 04:38
Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling,sibility of being futile and futility boundaries are specified. We apply this approach in banking default risk modeling monitoring to solve the optimal pairing ratio problem. Its effectiveness and efficiency are demonstrated by comparison with testing approach which is currently prevailing in banking models validation.作者: 魅力 時間: 2025-3-30 09:21
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230059.jpg作者: 小溪 時間: 2025-3-30 13:13 作者: Mechanics 時間: 2025-3-30 18:59 作者: 不透明 時間: 2025-3-30 20:53 作者: 頭盔 時間: 2025-3-31 03:36 作者: 推崇 時間: 2025-3-31 07:44 作者: 托人看管 時間: 2025-3-31 10:01
Srikanta Patnaik,Roumen Kountchev,Vipul Jain constant. This lower bound, together with the matching bound of information content heuristic, confirms the fact information content heuristic is slightly better than set cover greedy algorithm in worst case.作者: 重畫只能放棄 時間: 2025-3-31 14:47
Atsuo Hazeyama,Kiichi Furukawa,Yuki Yamadaa boundary refinement policy. Our experimental evaluations on 18 different benchmark graphs show that our algorithm produces high quality solutions compared with those produced by MeTiS that is a state-of-the-art partitioner in the literature.作者: AGONY 時間: 2025-3-31 20:54 作者: 輕率看法 時間: 2025-4-1 00:32
Elisabetta Basilico,Tommi Johnsenheorems are given. Thirdly, some on-line algorithms are designed to address the problem and the competitive analysis are given in detail. Furthermore, the lower bound of competitive ratio for some special cases is obtained. Finally, some conclusions are made and some future research directions are pointed out.作者: Aggressive 時間: 2025-4-1 02:22 作者: BROW 時間: 2025-4-1 08:48
I. V. Ravi Kumar,G. Rajitha,B. Nancharaiahnd propose an LP based bicriteria .-approximation algorithm. We give a 2-approximation algorithm for the version with bounded number of bins. Furthermore, we investigate properties of natural greedy algorithms, and present an easy to implement heuristic, which is fast and performs well in practice.作者: 集中營 時間: 2025-4-1 12:06 作者: CEDE 時間: 2025-4-1 17:17
Die inverse Gutenberg-Revolution,,.)-number of co-comparability graphs and interval graphs. To the best of our knowledge, ours is the first reported result concerning the .(.,.)-labeling of co-comparability graphs..In the special case where .?=?1, our result improves on the best previously-known approximation ratio for interval graphs.作者: 吸引人的花招 時間: 2025-4-1 21:22
Sequential Vector Packing,nd propose an LP based bicriteria .-approximation algorithm. We give a 2-approximation algorithm for the version with bounded number of bins. Furthermore, we investigate properties of natural greedy algorithms, and present an easy to implement heuristic, which is fast and performs well in practice.作者: nitric-oxide 時間: 2025-4-1 23:39
