標(biāo)題: Titlebook: Algorithms and Computation; 8th International Sy Hon Wai Leong,Hiroshi Imai,Sanjay Jain Conference proceedings 1997 Springer-Verlag Berlin [打印本頁(yè)] 作者: satisficer 時(shí)間: 2025-3-21 16:37
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: Osteoporosis 時(shí)間: 2025-3-21 20:20 作者: squander 時(shí)間: 2025-3-22 00:26
https://doi.org/10.1007/978-3-663-14807-4d on “Brent‘s theorem.” Using the measures of work, critical-path length, and serial space, a programmer can extrapolate the performance of his program to any number of processors. Moreover, divide-and-conquer-parallel algorithms can be analyzed in much the same way one analyzes divide-and-conquer s作者: fulcrum 時(shí)間: 2025-3-22 06:53
Der Konzerndatenschutzbeauftragtef broadcasting schemes in trees..We seek broadcasting schemes with low vulnerability, working for tree networks. It turns out that schemes that give the best broadcasting time in a fault-free environment may have very high vulnerability, i.e., poor fault-tolerance, for some trees. The main result of作者: 過份 時(shí)間: 2025-3-22 10:13 作者: Chameleon 時(shí)間: 2025-3-22 15:58
Two-face horn extensions,xpert systems, for such functions can be done in polynomial time, whereas abduction for general Horn functions is NP-hard. Our main results show that deciding if a pdBf has extensions of such functions can be done in polynomial time.作者: 開始發(fā)作 時(shí)間: 2025-3-22 18:31
Algorithmic analysis of multithreaded algorithms,d on “Brent‘s theorem.” Using the measures of work, critical-path length, and serial space, a programmer can extrapolate the performance of his program to any number of processors. Moreover, divide-and-conquer-parallel algorithms can be analyzed in much the same way one analyzes divide-and-conquer s作者: GIDDY 時(shí)間: 2025-3-23 00:19
Optimal fault-tolerant broadcasting in trees,f broadcasting schemes in trees..We seek broadcasting schemes with low vulnerability, working for tree networks. It turns out that schemes that give the best broadcasting time in a fault-free environment may have very high vulnerability, i.e., poor fault-tolerance, for some trees. The main result of作者: 不如樂死去 時(shí)間: 2025-3-23 01:49
Solving NP-hard combinatorial problems in the practical sense Invited presentation,作者: Prosaic 時(shí)間: 2025-3-23 09:14
Algorithms and Computation978-3-540-69662-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: RENIN 時(shí)間: 2025-3-23 13:40
Betriebswirtschaftliche Beitr?geng edges, (2) whose cardinalities are maximum among all matchings, (3) which are contained in no other matching. In this paper, we present three algorithms for enumerating these three types of matchings. Their time complexities are .(|. |) per a matching.作者: 五行打油詩(shī) 時(shí)間: 2025-3-23 14:14
Grundlagen des Konzernabschlusses,nsider the problem of augmenting . by the smallest number of new edges so that the edge-connectivity and vertex connectivity between every pair . become at least .. (.) and ..,(.), respectively, in the resulting graph .′. In this paper, we show that the problem can be solved in polynomial time if .. is given by ..,(.) = 2 for all ..作者: 元音 時(shí)間: 2025-3-23 21:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153118.jpg作者: ARIA 時(shí)間: 2025-3-24 00:15
Modell- und Hypothesenentwicklung,y during the scheduling period. Recently, however, the number of irregular flights has been increasing in order to satisfy the passengers‘ requirements. This article presents a new approach to reducing the total number of man-days in pilots‘ round-trip flight patterns (called crew pairings that cove作者: kidney 時(shí)間: 2025-3-24 05:45
https://doi.org/10.1007/978-3-658-16652-6n Problem. The optimization consists of two steps: application of the Greedy — Interchange heuristic using a small subset of warehouse candidates, and application of the newly developed heuristic named Balloon Search that takes account of all warehouse candidates. Our experiments on the spare parts 作者: 披肩 時(shí)間: 2025-3-24 10:33 作者: 地殼 時(shí)間: 2025-3-24 11:05 作者: convert 時(shí)間: 2025-3-24 18:46 作者: Additive 時(shí)間: 2025-3-24 22:54 作者: Pulmonary-Veins 時(shí)間: 2025-3-25 03:14
Rechnungswesen und Unternehmensüberwachungerties of the star graph, the algorithm can make routing decisions without deadlock and livelock. After faults are encountered, the algorithm routes messages to a given destination by finding a fault-free . —1-star graph. As long as the number . of faults (node faults and/or edge faults) is less tha作者: Sedative 時(shí)間: 2025-3-25 06:11
Rechnungswesen und Unternehmensüberwachungof . such that, for each edge {.} of . contains a path between . and .. We say that a set of paths . is .-colorable if each path of . can be colored by one of the . colors so that the paths of the same color are edge disjoint (each edge of . appears at most once in the paths of each single color). L作者: 沖擊力 時(shí)間: 2025-3-25 10:11 作者: 空中 時(shí)間: 2025-3-25 14:39 作者: Omnipotent 時(shí)間: 2025-3-25 18:50
Grundlagen des Konzernabschlusses,nsider the problem of augmenting . by the smallest number of new edges so that the edge-connectivity and vertex connectivity between every pair . become at least .. (.) and ..,(.), respectively, in the resulting graph .′. In this paper, we show that the problem can be solved in polynomial time if ..作者: 負(fù)擔(dān) 時(shí)間: 2025-3-25 20:35 作者: noxious 時(shí)間: 2025-3-26 00:37 作者: 分開如此和諧 時(shí)間: 2025-3-26 06:30 作者: 連鎖 時(shí)間: 2025-3-26 09:57
Der Konzerndatenschutzbeauftragte. A . (.) is a graph for which the vertices are the pseudo-lines of . and the edges are some un-ordered pairs of pseudo-lines of .. A . of pseudo-line graph (.) is a pair of edges .), .) ∈ ., (.) ∩ . = 0, such that the crossing point of the pseudo-lines . and . lies vertically between . and . and th作者: 季雨 時(shí)間: 2025-3-26 13:06 作者: MERIT 時(shí)間: 2025-3-26 18:06
Kopfschmerz bei Infektionskrankheiten, of the weights of the satisfied clauses. In this paper, we present a theoretical framewok of hybrid approaches combining the algorithms of Goemans-Williamson and Yannakakis. This framework leads to a unified analysis of the performance guarantees of proposed algorithms and also leads to a better ap作者: chisel 時(shí)間: 2025-3-26 23:40 作者: 駁船 時(shí)間: 2025-3-27 03:00
https://doi.org/10.1007/3-540-63890-3Algorithms; Computational Geometry; Discrete Mathematics; Matchings; Scientific Computing; complexity; geo作者: 直覺沒有 時(shí)間: 2025-3-27 08:17 作者: 周興旺 時(shí)間: 2025-3-27 13:28 作者: arboretum 時(shí)間: 2025-3-27 15:46 作者: Agronomy 時(shí)間: 2025-3-27 21:29 作者: deriver 時(shí)間: 2025-3-28 00:49
Der Konzerndatenschutzbeauftragteine graph. An immediate consequence of this theorem is that the .(...) upper bound on the .-level complexity of an arrangement of straight-lines, which is very recently discovered by Dey, holds for an arrangement of pseudo-lines as well.作者: 等級(jí)的上升 時(shí)間: 2025-3-28 05:00
Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae,gorithm presented in this paper, we also show how to maintain the satisfiability and the minimum model of a Horn formula . with . propositional symbols in total time .(.·Length(.)) over any sequence of clause deletions.作者: 責(zé)難 時(shí)間: 2025-3-28 08:19
A characterization of planar graphs by pseudo-line arrangements,ine graph. An immediate consequence of this theorem is that the .(...) upper bound on the .-level complexity of an arrangement of straight-lines, which is very recently discovered by Dey, holds for an arrangement of pseudo-lines as well.作者: Antioxidant 時(shí)間: 2025-3-28 12:04
Airline crew-scheduling problem with many irregular flights,r all regular and irregular flights. It systematically finds ways to merge irregular flights into pairings consisting only of regular flights. The approach is validated by the use of real-world datasets provided by an airline company.作者: confide 時(shí)間: 2025-3-28 15:45 作者: 不適 時(shí)間: 2025-3-28 22:34
Hard instance generation for SAT,nsform [SS71], its constant factor is too big in practice. Here we propose to use the Chinese Remainder Theorem for constructing efficient yet simple reductions from FACT to SAT. (In this extended abstract, most proofs are omitted; see [HW97].)作者: 北京人起源 時(shí)間: 2025-3-29 02:01 作者: OREX 時(shí)間: 2025-3-29 06:08 作者: deadlock 時(shí)間: 2025-3-29 09:48
https://doi.org/10.1007/978-3-642-92712-6t. However, no method has yet been shown strong enough to provide a tight analysis of this algorithm. In this paper, we present an analysis of the 3-dimensional case and show that on the .-mesh, it suffices to perform 21og.+ 10 rounds while 2log.+1 rounds are necessary. Moreover, tools for analyzing multi-dimensional Shearsort are provided.作者: 加入 時(shí)間: 2025-3-29 13:35
Leveraged buyouts und delegierte Kontrolle,tion, and it will be called the . problem. As a fundamental result on computational complexity, we show that the addition-shift-sequence problem is NP-complete. Then, we show lower and upper bounds of the number of operations for some particular sequence, where some techniques specific to our model are demonstrated.作者: 不可磨滅 時(shí)間: 2025-3-29 16:35
Rechnungswesen und Unternehmensüberwachungessages to a given destination by finding a fault-free . —1-star graph. As long as the number . of faults (node faults and/or edge faults) is less than the degree . ? 1 of the .-star graph, the algorithm can adaptively find a path of length at most . + 6. to route messages from a source to a destination, where . is the distance between tow nodes.作者: 鎮(zhèn)壓 時(shí)間: 2025-3-29 21:04
Rechnungswesen und Unternehmensüberwachungy one of the . colors so that the paths of the same color are edge disjoint (each edge of . appears at most once in the paths of each single color). Let .. denote the .-dimensional hypercube, for arbitrary . ≥ 1. We show that a routing problem (.., .) always admits a four-colorable solution when . is a matching, i.e., its maximum degree is one.作者: BRACE 時(shí)間: 2025-3-30 01:44
,II. Publizit?tsm?glichkeiten des Konzerns,e system load distribution. The cost we concern about is the maximum load among the edges. We use . to measure the performance of algorithms. We show that the competitive ratio for any algorithm is ,Ω(log .), and we provide an algorithm whose competitive ratio is .(log .).作者: OTHER 時(shí)間: 2025-3-30 07:15
Kopfschmerz bei Infektionskrankheiten,lliamson and Yannakakis. This framework leads to a unified analysis of the performance guarantees of proposed algorithms and also leads to a better approximation algorithm with performance guarantee 0.770, if we use a refinement of Yannakakis‘ algorithm.作者: 消滅 時(shí)間: 2025-3-30 08:27 作者: 高貴領(lǐng)導(dǎo) 時(shí)間: 2025-3-30 13:48 作者: ALT 時(shí)間: 2025-3-30 17:34
Formulation of the addition-shift-sequence problem and its complexity,tion, and it will be called the . problem. As a fundamental result on computational complexity, we show that the addition-shift-sequence problem is NP-complete. Then, we show lower and upper bounds of the number of operations for some particular sequence, where some techniques specific to our model are demonstrated.作者: stress-response 時(shí)間: 2025-3-31 00:39 作者: GILD 時(shí)間: 2025-3-31 03:25
Multi-color routing in the undirected hypercube,y one of the . colors so that the paths of the same color are edge disjoint (each edge of . appears at most once in the paths of each single color). Let .. denote the .-dimensional hypercube, for arbitrary . ≥ 1. We show that a routing problem (.., .) always admits a four-colorable solution when . is a matching, i.e., its maximum degree is one.作者: 分散 時(shí)間: 2025-3-31 09:02
Competitive source routing on tori and meshes,e system load distribution. The cost we concern about is the maximum load among the edges. We use . to measure the performance of algorithms. We show that the competitive ratio for any algorithm is ,Ω(log .), and we provide an algorithm whose competitive ratio is .(log .).作者: 有角 時(shí)間: 2025-3-31 11:31 作者: 有法律效應(yīng) 時(shí)間: 2025-3-31 13:34 作者: adduction 時(shí)間: 2025-3-31 19:22 作者: Orthodontics 時(shí)間: 2025-3-31 23:08 作者: 草本植物 時(shí)間: 2025-4-1 05:32
Modell- und Hypothesenentwicklung,r all regular and irregular flights. It systematically finds ways to merge irregular flights into pairings consisting only of regular flights. The approach is validated by the use of real-world datasets provided by an airline company.作者: inscribe 時(shí)間: 2025-4-1 07:55
https://doi.org/10.1007/978-3-658-16652-6logistics of a Japanese manufacturing company with 6,000 customers and 780,000 warehouse candidates led us to conclude that the Greedy heuristic improved the total cost by 9% – 11%, that the Interchange heuristic improved the total cost by an additional 0.5% – 1.5%, and that the Balloon Search improved it by a further 0.5% – 1.5%.作者: 刺穿 時(shí)間: 2025-4-1 12:28
https://doi.org/10.1007/978-3-642-92712-6nsform [SS71], its constant factor is too big in practice. Here we propose to use the Chinese Remainder Theorem for constructing efficient yet simple reductions from FACT to SAT. (In this extended abstract, most proofs are omitted; see [HW97].)作者: 殺菌劑 時(shí)間: 2025-4-1 16:41
