標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; 12th International C Shaojie Tang,Ding-Zhu Du,Sergiy Butenko Conference proceedings 2018 [打印本頁] 作者: purulent 時(shí)間: 2025-3-21 17:12
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management被引頻次
書目名稱Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management年度引用
書目名稱Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management讀者反饋
書目名稱Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: eustachian-tube 時(shí)間: 2025-3-21 21:45
https://doi.org/10.1007/978-3-030-04618-7approximation algorithms; artificial intelligence; computer networks; graph theory; heuristic algorithms作者: 共棲 時(shí)間: 2025-3-22 04:29
978-3-030-04617-0Springer Nature Switzerland AG 2018作者: insomnia 時(shí)間: 2025-3-22 06:05
Determination of Dual Distances for a Kind of Perfect Mixed Codes,tr?m. In this paper the minimal distance of the dual codes of a certain class of such perfect codes has been determined. As an application of this result we constructed a series of good orthogonal arrays with mixed levels and good inhomogeneous asymmetric quantum codes.作者: Ibd810 時(shí)間: 2025-3-22 10:24
The ,-power Domination Problem in Weighted Trees,r system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for .-power domination problem in weighted trees.作者: Conserve 時(shí)間: 2025-3-22 16:04
Conference proceedings 2018 Dallas, Texas, USA, in December 2018...The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications..作者: 生意行為 時(shí)間: 2025-3-22 18:00 作者: 不愿 時(shí)間: 2025-3-23 01:12
Algorithmic Aspects in Information and Management978-3-030-04618-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Small-Intestine 時(shí)間: 2025-3-23 05:26 作者: CUMB 時(shí)間: 2025-3-23 08:16
Wangmeng Zuo,Kai Zhang,Lei Zhangr system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for .-power domination problem in weighted trees.作者: 尊敬 時(shí)間: 2025-3-23 09:52
Tagebuchauszüge aus den Jahren 1810–1813s a Steiner tree. The diameter of a .-Steiner forest is referred to as the maximum distance between two terminals of a branch. This paper studies the . and establishes the relationship between MD.SFP and the .. We first obtain a 2-approximation to AS.CP by a dual approximation algorithm and then ach作者: ORE 時(shí)間: 2025-3-23 15:48 作者: Palate 時(shí)間: 2025-3-23 20:08 作者: 希望 時(shí)間: 2025-3-24 01:30
Dennis Potter: Between Two Worlds Griggs and Yeh. The .-dynamic coloring is a generalization of the .(1,?1)-labeling. An .-dynamic .-coloring of a graph . is a proper .-coloring such that every vertex . is adjacent to at least min. different colors. Denote . has an .-dynamic .-coloring} and . has a list .-dynamic .-coloring}. In th作者: 截?cái)?nbsp; 時(shí)間: 2025-3-24 02:55 作者: 改變 時(shí)間: 2025-3-24 09:41 作者: Osmosis 時(shí)間: 2025-3-24 12:32
https://doi.org/10.1057/9780230595903. in Modeling, Simulation and Verification Language (MSVL), and the desired property is also specified by an MSVL program .. Then program . and formula . are interpreted by means of executing programs . and .. If an acceptable execution path is generated, a counterexample is found, otherwise the pro作者: 政府 時(shí)間: 2025-3-24 14:55 作者: 外貌 時(shí)間: 2025-3-24 21:05
Robertson, Sir Dennis Holme (1890–1963)i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must carefully assign some amount of bundles to each buyer with respect to the buyer’s accepted price. Each buyer . is associated with a value function . such that . is the accepted unit bundle p作者: 泥沼 時(shí)間: 2025-3-25 00:46
Shall I Compare Thee to a Wild Duck?ty in a conjunction of Unit Two Variable per Inequality (UTVPI) constraints. Recall that a UTVPI constraint is a linear relationship of the form: ., where .. A conjunction of UTVPI constraints is called a UTVPI constraint system (UCS). UTVPI constraints subsume difference constraints. Unlike differe作者: 香料 時(shí)間: 2025-3-25 07:04
https://doi.org/10.1057/9780230595903heir reliabilities for computing effective task assignment plans and producing accurate estimations of truths. However, existing reliability models either cannot accurately estimate workers’ fine-grained reliabilities or require external information like text description. In this paper, we consider 作者: kidney 時(shí)間: 2025-3-25 07:51
The Characteristics of a Style,e calibration remains valid for a fixed time period of length ., after which it must be recalibrated before running more jobs. On the other hand, a certain cost will be incurred when the machine executes a job and the cost is determined by the time slots occupied by the job in the schedule. We work 作者: critic 時(shí)間: 2025-3-25 15:42
Wangmeng Zuo,Kai Zhang,Lei Zhangr system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for .-po作者: Melanocytes 時(shí)間: 2025-3-25 19:26 作者: 溫和女人 時(shí)間: 2025-3-25 21:30 作者: 并置 時(shí)間: 2025-3-26 00:30 作者: Mortar 時(shí)間: 2025-3-26 06:51
https://doi.org/10.1007/978-3-319-96625-0development of the smartphone technology, dynamic ridesharing systems enable passengers request a car anytime and anywhere. This paper mainly considers the problems of how to allocate passengers to drivers, how to charge the passengers and how to design feasible schedules for the driver in such onli作者: 我沒有命令 時(shí)間: 2025-3-26 08:53
https://doi.org/10.1007/978-3-319-96625-0 and its cost is given by the maximum weight of the cycles. The Minimum Cycle Cover Problem (MCCP) aims to find a cycle cover of cost at most . with the minimum number of cycles. We propose new LP relaxations for MCCP as well as its variants, called the Minimum Path Cover Problem (MPCP) and the Mini作者: 清洗 時(shí)間: 2025-3-26 14:33 作者: asthma 時(shí)間: 2025-3-26 17:45
Conference proceedings 2018 Dallas, Texas, USA, in December 2018...The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications..作者: 有罪 時(shí)間: 2025-3-26 22:40
,Conclusion: ‘A Fitting Memorial?’,s ., where . and . is the number of sets containing element .. In the case ., an .-bicriteria solution can be achieved even when monotonicity requirement is dropped off from the cost function, where . is the maximum number of sets containing a common element.作者: 強(qiáng)有力 時(shí)間: 2025-3-27 04:52
https://doi.org/10.1057/9780230595903ch incoming worker a set of tasks with the Maximum Expected Gain (MEG). The experimental results demonstrate that our method can significantly decrease the number of task assignments and achieve higher . than the state-of-the-art approaches.作者: 線 時(shí)間: 2025-3-27 07:24 作者: Indigence 時(shí)間: 2025-3-27 10:05
https://doi.org/10.1007/978-3-030-98653-7s in the grid. Following the structure of Applegate et al.’s algorithm, we simplify the solution, remove redundancies in data structures, and exploit overlapping sub-problems in order to achieve an optimal solution for strip-rule RRLs in . log .) time.作者: 貪婪性 時(shí)間: 2025-3-27 17:19
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem,s ., where . and . is the number of sets containing element .. In the case ., an .-bicriteria solution can be achieved even when monotonicity requirement is dropped off from the cost function, where . is the maximum number of sets containing a common element.作者: Audiometry 時(shí)間: 2025-3-27 20:29
Quality-Aware Online Task Assignment Using Latent Topic Model,ch incoming worker a set of tasks with the Maximum Expected Gain (MEG). The experimental results demonstrate that our method can significantly decrease the number of task assignments and achieve higher . than the state-of-the-art approaches.作者: sclera 時(shí)間: 2025-3-28 01:58 作者: 出價(jià) 時(shí)間: 2025-3-28 03:21 作者: jocular 時(shí)間: 2025-3-28 09:27
0302-9743 8, held in Dallas, Texas, USA, in December 2018...The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications..978-3-030-04617-0978-3-030-04618作者: NORM 時(shí)間: 2025-3-28 11:55 作者: lymphoma 時(shí)間: 2025-3-28 16:10
Dennis Potter: Between Two Worldsthat every vertex . is adjacent to at least min. different colors. Denote . has an .-dynamic .-coloring} and . has a list .-dynamic .-coloring}. In this paper, we show upper bounds . for planar graphs . with . and ., . for graphs . with ..作者: 強(qiáng)有力 時(shí)間: 2025-3-28 20:45
https://doi.org/10.1057/9780230595903a . are interpreted by means of executing programs . and .. If an acceptable execution path is generated, a counterexample is found, otherwise the property is valid. To show how the proposed approach works, an example is given.作者: 寡頭政治 時(shí)間: 2025-3-29 00:52 作者: Chagrin 時(shí)間: 2025-3-29 05:49 作者: 江湖騙子 時(shí)間: 2025-3-29 08:59 作者: JECT 時(shí)間: 2025-3-29 11:50
Profit Maximization Problem with Coupons in Social Networks,endent Cascade Model with Coupons and Valuations (IC-CV). To solve this problem, we propose the PMCA algorithm which can return a .-approximate solution with at least . probability, and runs in . expected time. Further more, during the analysis we provide a method to estimate the non-monotone submodular function.作者: 清洗 時(shí)間: 2025-3-29 16:32
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems,mum Tree Cover Problem, where the cycles are replaced by paths or trees. Moreover, we give new LP relaxations for a special case of the rooted version of MCCP/MPCP and show that these LP relaxations have significantly better integrality gaps than the previous relaxations.作者: 推測 時(shí)間: 2025-3-29 20:19
Computation of Kullback-Leibler Divergence Between Labeled Stochastic Systems with Non-identical Stis computed to measure the closeness of stochastic systems. A fixed point polynomial time algorithm is presented to compute Kullback-Leibler divergence with an approximation when comparing labeled stochastic systems with non-identical state spaces.作者: Humble 時(shí)間: 2025-3-29 23:58 作者: SPER 時(shí)間: 2025-3-30 06:51 作者: terazosin 時(shí)間: 2025-3-30 08:32 作者: Visual-Acuity 時(shí)間: 2025-3-30 15:09 作者: obviate 時(shí)間: 2025-3-30 20:20
Approximation and Competitive Algorithms for Single-Minded Selling Problem,. For the online version, i.e., the buyers come one by one and the decision on each buyer must be made before the arrival of the next buyer, an .-competitive algorithm is achieved, where . is the highest unit item price among all buyers.作者: 功多汁水 時(shí)間: 2025-3-30 22:13 作者: fodlder 時(shí)間: 2025-3-31 01:42 作者: Acetaminophen 時(shí)間: 2025-3-31 07:53 作者: Limited 時(shí)間: 2025-3-31 10:38 作者: SMART 時(shí)間: 2025-3-31 16:41
https://doi.org/10.1007/978-3-319-96625-0mum Tree Cover Problem, where the cycles are replaced by paths or trees. Moreover, we give new LP relaxations for a special case of the rooted version of MCCP/MPCP and show that these LP relaxations have significantly better integrality gaps than the previous relaxations.作者: capsule 時(shí)間: 2025-3-31 18:54 作者: 侵略者 時(shí)間: 2025-4-1 00:22
Prinzipien der modernen Informationstechnik,fluence the denoising effectiveness, we build a unified neural framework with word, sentence and label denoising modules for relation extraction. Then we conduct experiments to evaluate and compare these factors according to ten neural schemes. In addition, we discuss the typical cases of these fact作者: ligature 時(shí)間: 2025-4-1 04:41
https://doi.org/10.1007/978-3-0348-6572-2. Then, we present a ./2-approximation algorithm for the graph balancing problem with .?bags; the approximation ratio is tight for . unless . and this algorithm solves the graph balancing problem with .?bags in polynomial time. In addition, we present a polynomial-time algorithm for the restricted a作者: 好色 時(shí)間: 2025-4-1 06:52
Shall I Compare Thee to a Wild Duck?). We compare our implementations to the Yices SMT solver [.] running linear real arithmetic (QF_LRA) and linear integer arithmetic (QF_LIA). Our experiments indicate that . is moderately superior to . in terms of time, and that . is . superior to . in terms of time. Additionally on small inputs the作者: 異常 時(shí)間: 2025-4-1 11:44
Factors Impacting the Label Denoising of Neural Relation Extraction,fluence the denoising effectiveness, we build a unified neural framework with word, sentence and label denoising modules for relation extraction. Then we conduct experiments to evaluate and compare these factors according to ten neural schemes. In addition, we discuss the typical cases of these fact作者: 不容置疑 時(shí)間: 2025-4-1 16:16 作者: ADOPT 時(shí)間: 2025-4-1 19:17
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints,). We compare our implementations to the Yices SMT solver [.] running linear real arithmetic (QF_LRA) and linear integer arithmetic (QF_LIA). Our experiments indicate that . is moderately superior to . in terms of time, and that . is . superior to . in terms of time. Additionally on small inputs the作者: 其他 時(shí)間: 2025-4-2 01:21
Minimum Diameter ,-Steiner Forest,s a Steiner tree. The diameter of a .-Steiner forest is referred to as the maximum distance between two terminals of a branch. This paper studies the . and establishes the relationship between MD.SFP and the .. We first obtain a 2-approximation to AS.CP by a dual approximation algorithm and then ach作者: disparage 時(shí)間: 2025-4-2 04:13
Factors Impacting the Label Denoising of Neural Relation Extraction,dress the challenge of automatically labeling large-scale training data, a distant supervision strategy is introduced to relation extraction by heuristically aligning entity pairs in plain text with the knowledge base. Unfortunately, the method is vulnerable to the noisy label problem due to the inc作者: output 時(shí)間: 2025-4-2 10:13 作者: 你正派 時(shí)間: 2025-4-2 13:12
