標(biāo)題: Titlebook: Algorithms - ESA ‘95; Third Annual Europea Paul Spirakis Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Algorithmenanal [打印本頁] 作者: Lampoon 時(shí)間: 2025-3-21 16:43
書目名稱Algorithms - ESA ‘95影響因子(影響力)
書目名稱Algorithms - ESA ‘95影響因子(影響力)學(xué)科排名
書目名稱Algorithms - ESA ‘95網(wǎng)絡(luò)公開度
書目名稱Algorithms - ESA ‘95網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms - ESA ‘95被引頻次
書目名稱Algorithms - ESA ‘95被引頻次學(xué)科排名
書目名稱Algorithms - ESA ‘95年度引用
書目名稱Algorithms - ESA ‘95年度引用學(xué)科排名
書目名稱Algorithms - ESA ‘95讀者反饋
書目名稱Algorithms - ESA ‘95讀者反饋學(xué)科排名
作者: 追逐 時(shí)間: 2025-3-21 21:24 作者: 新鮮 時(shí)間: 2025-3-22 03:56
Jonny Hobbhahn,Peter Conzen,Kai Taeger worst case bounds, where the number of rounds characterize circuit depth, in the average case the Karchmer-Widgerson game is only a lower bound. We construct a function . and a set of minterms and maxterms such that on this set the average time needed for any monotone circuit to compute . is polyno作者: 得罪 時(shí)間: 2025-3-22 05:35
Fischers Fritze fischt frische Fische...,he ordering at random)..In this work we present a polynomial time algorithm which either determines that there is no feasible solution, or finds a total order which satisfies at least 1/2 of the . constraints. Our algorithm translates the problem into a set of quadratic inequalities, and solves a se作者: 職業(yè)拳擊手 時(shí)間: 2025-3-22 10:38 作者: Dealing 時(shí)間: 2025-3-22 15:44 作者: Indurate 時(shí)間: 2025-3-22 19:10
Average circuit depth and average communication complexity, worst case bounds, where the number of rounds characterize circuit depth, in the average case the Karchmer-Widgerson game is only a lower bound. We construct a function . and a set of minterms and maxterms such that on this set the average time needed for any monotone circuit to compute . is polyno作者: 燦爛 時(shí)間: 2025-3-22 23:11 作者: 劇毒 時(shí)間: 2025-3-23 01:54 作者: 壓碎 時(shí)間: 2025-3-23 08:15
R. P. Meyer Dr. med.,H. K. Schwyzer Dr. med.ine an extension of Valiant‘s BSP model, BSP., that rewards blockwise communication, and uses Valiant‘s notion of .-optimality. Intuitively a .-optimal parallel algorithm for . processors achieves speed-up close to .. We consider the Multisearch problem: Assume a strip in 2D to be partitioned into .作者: LVAD360 時(shí)間: 2025-3-23 11:35 作者: Euphonious 時(shí)間: 2025-3-23 17:43
R. P. Meyer Dr. med.,F. Moro Dr. med. of an .-processor CRCW PRAM on an .-processor DMM with .log log log . log..) delay, with high probability. This is an exponential improvement on all previously known simulations. It can be extended to a simulation of an (. log log log . log..)-processor EREW PRAM on an .-processor DMM with optimal 作者: epicardium 時(shí)間: 2025-3-23 20:37 作者: ALIEN 時(shí)間: 2025-3-23 22:15 作者: 時(shí)間等 時(shí)間: 2025-3-24 04:35
https://doi.org/10.1007/978-3-642-77007-4presented for the exclusive-read exclusive-write (EREW) PRAM and the Optical Communication Parallel Computer (OCPC), but it applies to a large class of parallel computers. It is shown that simulations of operational multiprocessor machines on faulty ones can be performed with logarithmic slowdown in作者: 小平面 時(shí)間: 2025-3-24 08:13 作者: Overstate 時(shí)間: 2025-3-24 10:54 作者: 雀斑 時(shí)間: 2025-3-24 16:21 作者: Inkling 時(shí)間: 2025-3-24 22:12
https://doi.org/10.1007/978-3-642-77007-4 parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew-symmetric flow case. In the special case of the skew-symmetric flow problem that corresponds to cardinality matching, our algorithm is simpler and mor作者: 細(xì)菌等 時(shí)間: 2025-3-25 01:33 作者: 畏縮 時(shí)間: 2025-3-25 05:10
J. F. Baron,M. Moutafis,P. Viars is shown to hold with high probability for a wide class of probability distributions on non-negatively weighted digraphs. We also prove that for a large class of probability distributions Ω(. log .) time is necessary with high probability to compute shortest path distances with respect to a single 作者: allergy 時(shí)間: 2025-3-25 08:16 作者: –吃 時(shí)間: 2025-3-25 15:39
Krankheitsbild mit Differentialdiagnose,informational and mathematical sciences. In particular, we study C-planarity of clustered graphs. Given a clustered graph, the C-planarity testing problem is to determine whether the clustered graph can be drawn without edge crossings, or edge-region crossings. In this paper, we present efficient al作者: constellation 時(shí)間: 2025-3-25 18:42 作者: GRUEL 時(shí)間: 2025-3-25 22:55
Der klinische Blick in der Sozialen Arbeitey are not extremely long and skinny) then the BSP has linear size and it can be constructed in . log..) time, where . is the number of objects. In fact, the method produces a linear size BSP for a more general class of scenes, namely scenes that satisfy the . condition—a property that we suspect ma作者: Hearten 時(shí)間: 2025-3-26 01:02 作者: PHAG 時(shí)間: 2025-3-26 06:28 作者: Talkative 時(shí)間: 2025-3-26 09:52
https://doi.org/10.1007/3-540-60313-1Algorithmenanalyse; Algorithmenentwurf; Algorithms Analysis; Algorithms Design; Combinatorial Optimizati作者: linear 時(shí)間: 2025-3-26 15:27 作者: Epithelium 時(shí)間: 2025-3-26 17:10 作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-26 22:43 作者: FLASK 時(shí)間: 2025-3-27 04:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153298.jpg作者: affect 時(shí)間: 2025-3-27 08:30
On the all-pairs shortest path algorithm of Moffat and Takaoka, is shown to hold with high probability for a wide class of probability distributions on non-negatively weighted digraphs. We also prove that for a large class of probability distributions Ω(. log .) time is necessary with high probability to compute shortest path distances with respect to a single source.作者: LEER 時(shí)間: 2025-3-27 11:42
On mixed connectivity certificates,ates of .-connectivity for a graph are obtained by removing a subset of its edges, while preserving its connectivity up to ...We unify the previous work on connectivity certificates and extend it to handle mixed connectivity and multigraphs. Our treatment contributes a new insight of the pertinent s作者: Contend 時(shí)間: 2025-3-27 17:26
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,ine an extension of Valiant‘s BSP model, BSP., that rewards blockwise communication, and uses Valiant‘s notion of .-optimality. Intuitively a .-optimal parallel algorithm for . processors achieves speed-up close to .. We consider the Multisearch problem: Assume a strip in 2D to be partitioned into .作者: Overdose 時(shí)間: 2025-3-27 21:39 作者: 繁殖 時(shí)間: 2025-3-27 22:41
Shared memory simulations with triple-logarithmic delay, of an .-processor CRCW PRAM on an .-processor DMM with .log log log . log..) delay, with high probability. This is an exponential improvement on all previously known simulations. It can be extended to a simulation of an (. log log log . log..)-processor EREW PRAM on an .-processor DMM with optimal 作者: AND 時(shí)間: 2025-3-28 04:26 作者: cauda-equina 時(shí)間: 2025-3-28 06:17 作者: 津貼 時(shí)間: 2025-3-28 11:34 作者: 高興一回 時(shí)間: 2025-3-28 15:35
Average circuit depth and average communication complexity,cuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, [JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs to the gate)..More precisely, we show that the aver作者: 結(jié)果 時(shí)間: 2025-3-28 22:37
Packing trees,en a tree ., find a packing, an allocation of its nodes to pages, which optimizes the cache performance. We investigate a model for tree access in which a node is accessed only via the path leading to it from the root. Two cost functions are considered: the total number of different pages visited in作者: 評(píng)論者 時(shí)間: 2025-3-29 01:18
Sometimes travelling is easy: The master tour problem,s called the . conditions) then the TSP is solvable in polynomial time..We deal with the problem of deciding for a given instance of the TSP, whether there is a renumbering of the cities such that the corresponding renumbered distance matrix fulfills the Kalmanson conditions. Two results are derived作者: sclera 時(shí)間: 2025-3-29 06:47
Maximum skew-symmetric flows, parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew-symmetric flow case. In the special case of the skew-symmetric flow problem that corresponds to cardinality matching, our algorithm is simpler and mor作者: 要求比…更好 時(shí)間: 2025-3-29 09:59 作者: FAWN 時(shí)間: 2025-3-29 12:45
On the all-pairs shortest path algorithm of Moffat and Takaoka, is shown to hold with high probability for a wide class of probability distributions on non-negatively weighted digraphs. We also prove that for a large class of probability distributions Ω(. log .) time is necessary with high probability to compute shortest path distances with respect to a single 作者: 起草 時(shí)間: 2025-3-29 19:01 作者: 腐爛 時(shí)間: 2025-3-29 19:47 作者: 喊叫 時(shí)間: 2025-3-30 02:00 作者: 設(shè)想 時(shí)間: 2025-3-30 07:14
Linear size binary space partitions for fat objects,ey are not extremely long and skinny) then the BSP has linear size and it can be constructed in . log..) time, where . is the number of objects. In fact, the method produces a linear size BSP for a more general class of scenes, namely scenes that satisfy the . condition—a property that we suspect ma作者: VEN 時(shí)間: 2025-3-30 10:06
R. P. Meyer Dr. med.,H. K. Schwyzer Dr. med. for a wide range of BSP. parameters where the range becomes larger with growing input sizes . and .. We further report on implementation work in progress. Previous parallel algorithms for Multisearch were far away from being .-optimal in our model and do not consider blockwise communication.作者: fidelity 時(shí)間: 2025-3-30 12:51 作者: LINES 時(shí)間: 2025-3-30 19:04 作者: Foreknowledge 時(shí)間: 2025-3-30 21:07
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model, for a wide range of BSP. parameters where the range becomes larger with growing input sizes . and .. We further report on implementation work in progress. Previous parallel algorithms for Multisearch were far away from being .-optimal in our model and do not consider blockwise communication.作者: coltish 時(shí)間: 2025-3-31 01:15 作者: 輕率的你 時(shí)間: 2025-3-31 05:51
Packing trees, be NP-complete. However, an efficient approximation algorithm is presented. This algorithm finds a packing that uses the minimum number of pages, and requires at most one extra page fault per search. Finally, we study dynamic trees which allow insertions and deletions.作者: delta-waves 時(shí)間: 2025-3-31 09:50 作者: 陪審團(tuán) 時(shí)間: 2025-3-31 13:54 作者: cipher 時(shí)間: 2025-3-31 18:28 作者: ELUDE 時(shí)間: 2025-3-31 22:53 作者: genesis 時(shí)間: 2025-4-1 05:33
0302-9743 inent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design.978-3-540-60313-9978-3-540-44913-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 瑣碎 時(shí)間: 2025-4-1 07:18
R. P. Meyer Dr. med.,F. Moro Dr. med.delay .(log log log . log..), with high probability. Finally a lower bound of .(log log log ./log log log log .) expected time is proved for a large class of randomized simulations that includes all known simulations.
