標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; 10th International C Qianping Gu,Pavol Hell,Boting Yang Conference proceedings 2014 Spri [打印本頁(yè)] 作者: 機(jī)會(huì) 時(shí)間: 2025-3-21 19:29
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management影響因子(影響力)
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management被引頻次
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management年度引用
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management讀者反饋
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: strain 時(shí)間: 2025-3-21 23:23
A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Sumparison to a state-of-the-art ant colony system approach is performed based on a real case of maritime surveillance application and some randomly generated instances. The analysis of the results obtained in the two sets was supported by statistical nonparametric Wilcoxon signed-rank tests. The expe作者: 休戰(zhàn) 時(shí)間: 2025-3-22 02:03 作者: 無(wú)底 時(shí)間: 2025-3-22 08:34 作者: tackle 時(shí)間: 2025-3-22 11:00 作者: Virtues 時(shí)間: 2025-3-22 13:13
https://doi.org/10.1007/978-3-642-92004-2ted by the minimax problem and the minisum problem, respectively. We study the .-sink location problem in dynamic path networks with continuous model, and prove that the minimax problem can be solved in .(. log.) time and the minisum problem can be solved in .(..) time, where . is the number of vert作者: adulterant 時(shí)間: 2025-3-22 17:10
Algorithmic Aspects in Information and Management978-3-319-07956-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 孵卵器 時(shí)間: 2025-3-23 01:14
Recht des Erfinders auf das Patent,the proposed problem, where . is the number of vertices. In this paper, we study the general problem, i.e., minimax regret .-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an . time algorithm for the general problem, where . is the number of combination choosing .???1 from ..作者: Eosinophils 時(shí)間: 2025-3-23 01:31
https://doi.org/10.1007/978-3-642-91904-6ize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. We show that there is an optimal polynomial time algorithm for this model.作者: 紡織品 時(shí)間: 2025-3-23 06:48 作者: Cholesterol 時(shí)間: 2025-3-23 11:07
Die Typhusbek?mpfung als Verwaltungsma?nahmesimilarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained. With experiments we show that the approach works well when compared to other approaches that are also oblivious towards the relationship between the input datasets.作者: 隱藏 時(shí)間: 2025-3-23 14:24
Die bakteriologische Typhusdiagnose in graphs with .. Using this, we present improved lower bounds on .(.) when .?=?2.???2. and .?=?2.???2.?+?1 (3?≤?.?
作者: 是貪求 時(shí)間: 2025-3-23 20:05
https://doi.org/10.1007/978-3-662-01386-1density . to detect this event region, i.e., its boundary. The model of sensor is a 0-1 sensor that decides whether it lies in . or not, and which might be incorrect with probability .. It also collects information on the 0-1 values of the neighbors within some distance . and revises its decision by作者: eczema 時(shí)間: 2025-3-24 02:14 作者: lobster 時(shí)間: 2025-3-24 03:35 作者: 多嘴多舌 時(shí)間: 2025-3-24 08:53
,Bauleitung, bauausführende Firmen,or each .., the amount of product to be sold to .. at the then-prevailing market price ... The objective is to maximize the seller’s revenue. We note that most previous algorithms for the problem need to impose some artificial upper bound . and lower bound . on the market prices, and the seller need作者: 雪上輕舟飛過(guò) 時(shí)間: 2025-3-24 13:42 作者: 碳水化合物 時(shí)間: 2025-3-24 15:20
https://doi.org/10.1007/978-3-642-91904-6ize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. We show that there is an optimal polynomial time algorithm for this model.作者: NOT 時(shí)間: 2025-3-24 20:43 作者: 預(yù)防注射 時(shí)間: 2025-3-25 00:11 作者: GNAW 時(shí)間: 2025-3-25 04:29 作者: Schlemms-Canal 時(shí)間: 2025-3-25 09:50
https://doi.org/10.1007/978-3-642-92004-2 nodes, a Steiner tree is a connected, acyclic subgraph that contains all the terminal nodes in .. The goal of . is to find as many element-disjoint Steiner trees as possible. . is known to be .-hard even for |.|?=?3 [1]. It is also known that . is .-hard to approximate within a factor of Ω(log|.|) 作者: 瑪瑙 時(shí)間: 2025-3-25 13:43 作者: Nonconformist 時(shí)間: 2025-3-25 16:23 作者: 嘲弄 時(shí)間: 2025-3-25 22:15 作者: 愛(ài)國(guó)者 時(shí)間: 2025-3-26 02:09
https://doi.org/10.1007/978-3-642-92004-2sitive edge lengths, uniform edge capacity, and positive vertex supplies. Here, each vertex supply corresponds to a set of evacuees. Then, the problem requires to find the optimal location of . sinks in a given path so that each evacuee is sent to one of . sinks. Let . denote a .-sink location. Unde作者: Commodious 時(shí)間: 2025-3-26 05:10
Bazillentr?ger und Dauerausscheiderset of a graph’s vertex set can be extended to a .-colouring of the whole graph. A .-list assignment of a graph is an allocation of a list — a subset of {1,…,.} — to each vertex, and the ... problem asks whether the graph has a .-colouring in which each vertex is coloured with a colour from its list作者: hemorrhage 時(shí)間: 2025-3-26 09:40 作者: 不溶解 時(shí)間: 2025-3-26 13:36 作者: fibroblast 時(shí)間: 2025-3-26 18:17 作者: 事與愿違 時(shí)間: 2025-3-26 23:55
Minimax Regret k-sink Location Problem in Dynamic Path Networksthe proposed problem, where . is the number of vertices. In this paper, we study the general problem, i.e., minimax regret .-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an . time algorithm for the general problem, where . is the number of combination choosing .???1 from ..作者: synovitis 時(shí)間: 2025-3-27 01:40 作者: capsule 時(shí)間: 2025-3-27 05:43 作者: 試驗(yàn) 時(shí)間: 2025-3-27 09:39
Finding Robust Minimum Cutssimilarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained. With experiments we show that the approach works well when compared to other approaches that are also oblivious towards the relationship between the input datasets.作者: 大氣層 時(shí)間: 2025-3-27 13:50
New Lower Bounds on Broadcast Function in graphs with .. Using this, we present improved lower bounds on .(.) when .?=?2.???2. and .?=?2.???2.?+?1 (3?≤?.?
作者: DEMUR 時(shí)間: 2025-3-27 17:56
Conference proceedings 2014ouver, BC, Canada, in July 2014..The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 45 submissions. The topics cover most areas in discrete algorithms and their applications..作者: 沐浴 時(shí)間: 2025-3-27 22:30
0302-9743 ld in Vancouver, BC, Canada, in July 2014..The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 45 submissions. The topics cover most areas in discrete algorithms and their applications..978-3-319-07955-4978-3-319-07956-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Affectation 時(shí)間: 2025-3-28 03:54 作者: 體貼 時(shí)間: 2025-3-28 07:07
978-3-319-07955-4Springer International Publishing Switzerland 2014作者: 不足的東西 時(shí)間: 2025-3-28 11:16 作者: 享樂(lè)主義者 時(shí)間: 2025-3-28 17:59
Eigenschaften der TyphusbazillenWe study the parameterized complexity of the following . problem: Given a graph . and an integer . as parameter, determine whether . can be modified into a split graph by contracting at most . edges. We show that . can be solved in FPT time ., but admits no polynomial kernel unless .???./..作者: CALL 時(shí)間: 2025-3-28 22:47 作者: 羽毛長(zhǎng)成 時(shí)間: 2025-3-29 01:52
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Schemedensity . to detect this event region, i.e., its boundary. The model of sensor is a 0-1 sensor that decides whether it lies in . or not, and which might be incorrect with probability .. It also collects information on the 0-1 values of the neighbors within some distance . and revises its decision by作者: jocular 時(shí)間: 2025-3-29 04:54
On the Exact Block Cover Problemas a factor .(log.log..) and it was shown most recently that it is FPT (but with a very high running time). In this paper, we consider the decision version of the one-sided MCSP problem (formally called the . problem); namely, when one sequence is already partitioned into . blocks, how to decide whe作者: 統(tǒng)治人類(lèi) 時(shí)間: 2025-3-29 08:11
Minimax Regret k-sink Location Problem in Dynamic Path Networksthe proposed problem, where . is the number of vertices. In this paper, we study the general problem, i.e., minimax regret .-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an . time algorithm for the general problem, where . is t作者: 針葉 時(shí)間: 2025-3-29 15:03
Competitive Algorithms for Unbounded One-Way Tradingor each .., the amount of product to be sold to .. at the then-prevailing market price ... The objective is to maximize the seller’s revenue. We note that most previous algorithms for the problem need to impose some artificial upper bound . and lower bound . on the market prices, and the seller need作者: FLINT 時(shí)間: 2025-3-29 17:08 作者: Cerumen 時(shí)間: 2025-3-29 23:03
Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Tiize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. We show that there is an optimal polynomial time algorithm for this model.作者: lymphoma 時(shí)間: 2025-3-30 00:17 作者: Nuance 時(shí)間: 2025-3-30 05:09 作者: judiciousness 時(shí)間: 2025-3-30 10:33 作者: 規(guī)范要多 時(shí)間: 2025-3-30 15:22 作者: 無(wú)王時(shí)期, 時(shí)間: 2025-3-30 20:15 作者: GEST 時(shí)間: 2025-3-30 20:49 作者: 不能妥協(xié) 時(shí)間: 2025-3-31 00:57 作者: ORBIT 時(shí)間: 2025-3-31 08:21 作者: forecast 時(shí)間: 2025-3-31 10:15 作者: Aerate 時(shí)間: 2025-3-31 16:07 作者: 使腐爛 時(shí)間: 2025-3-31 19:24 作者: 事物的方面 時(shí)間: 2025-4-1 01:14
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weightsshortest paths problem. Our algorithm works on both deterministic digraphs and undirected graphs. For a deterministic digraph with positive arc weights, our algorithm handles a single arc weight increase in . expected time, where . is the number of nodes and . is the number of edges in the digraph. 作者: Cougar 時(shí)間: 2025-4-1 03:16
Karl Schaechterle,Louis Wintergerst) If each letter is allowed to appear at most twice (or three times), then the problem is polynomially solvable, (2) There is an FPT algorithm which runs in ..(2.) time, improving the trivial bound of ..(.!), and (3) If |Σ|?=?., . being a constant at least 2, then the problem is NP-complete.作者: Sedative 時(shí)間: 2025-4-1 08:41
Die Typhusbek?mpfung als Verwaltungsma?nahmeame parts are extended from core tokens to left and right boundaries for correctly recognizing the protein name. Based on Yapex101 corpus, Protein Name Recognition System (PNRS) achieves the F-score (74.49%) better than existing systems and papers.作者: Toxoid-Vaccines 時(shí)間: 2025-4-1 13:33
On the Exact Block Cover Problem) If each letter is allowed to appear at most twice (or three times), then the problem is polynomially solvable, (2) There is an FPT algorithm which runs in ..(2.) time, improving the trivial bound of ..(.!), and (3) If |Σ|?=?., . being a constant at least 2, then the problem is NP-complete.作者: 半球 時(shí)間: 2025-4-1 17:47 作者: 無(wú)瑕疵 時(shí)間: 2025-4-1 19:23 作者: 教義 時(shí)間: 2025-4-2 00:46
https://doi.org/10.1007/978-3-642-92004-2ous values of . and .. We propose an optimal coloring scheme for the number of facilities . being a multiple of . as well as for the general case where . is not a multiple of .. When n is a multiple of ., we compute an optimal scheme in Θ(.) time. For the general case, we propose a coloring scheme that returns the optimal in .(..log.) time.作者: neutral-posture 時(shí)間: 2025-4-2 02:49
Bazillentr?ger und Dauerausscheideration of a heap, representing grid values compactly in the array, yet still allowing access by a single index lookup rather than pointer jumping. We demonstrate good size/approximation performance in a natural application.
