標題: Titlebook: Computing and Combinatorics; Second Annual Intern Jin-Yi Cai,Chak Kuen Wong Conference proceedings 1996 Springer-Verlag Berlin Heidelberg 1 [打印本頁] 作者: credit 時間: 2025-3-21 18:18
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡公開度
書目名稱Computing and Combinatorics網(wǎng)絡公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: BLUSH 時間: 2025-3-21 23:33
Heat Penetration in Packaged Foods,a .(. loglog .). They include .-balanced trees, red-black trees, BB [α]-trees, and (., .)-trees. ., trees in the same classes admit .(.(loglog .).)-area strictly upward straight-line drawings that preserve the left-to-right ordering of the children of each vertex. Finally, we discuss an extension of作者: pellagra 時間: 2025-3-22 01:21 作者: 健談的人 時間: 2025-3-22 08:09 作者: HARP 時間: 2025-3-22 09:17 作者: 尖叫 時間: 2025-3-22 13:22
On sparse parity check matrices (extended abstract),at each . columns are linearly independent modulo 2. For fixed integers . ≥ 2 and . ≥ 1, we show the probabilistic lower bound .(.) = Ω(..); for . a power of 2, we prove the upper bound .(.) = .(..), which matches the lower bound for infinitely many values of .. We give some explicit constructions.作者: 尖叫 時間: 2025-3-22 20:14 作者: GENRE 時間: 2025-3-23 00:30 作者: 組裝 時間: 2025-3-23 05:13
A note on the simulation of exponential threshold weights, .. can be computed (“simulated”) in threshold . 2 with polynomial size. In this paper, we modify the method from [GK] to obtain an improvement in two respects: The approach described here is simpler and the size of the simulating circuit is smaller.作者: irritation 時間: 2025-3-23 07:52 作者: 小木槌 時間: 2025-3-23 09:43
Optimal bi-level augmentation for selective! enhancing graph connectivity with applications,nally vertex-disjoint paths between every pair of vertices in .. and two edgedisjoint paths between every pair of vertices in ... We solve the bi-level augmentation problem in .(.) time, where . and . are the numbers of vertices and edges in .. Our algorithm can be parallelized to run in .(log..) time using . processors on an EREW PRAM.作者: entail 時間: 2025-3-23 15:32 作者: 不斷的變動 時間: 2025-3-23 20:41 作者: 松緊帶 時間: 2025-3-24 01:21 作者: outskirts 時間: 2025-3-24 05:39
Miros?aw Koz?owski,Janina Marciak-Koz?owska of numbers .(.) and .(.) such that .(.) is the number of components coinciding in . and . and, .(.) is the sum of .(.) and the number of components occurring in both . and . but, not at the same position. We show that .+ 2.log. + 2. + 2 queries are sufficient to find any hidden code if . ≥ ..作者: obtuse 時間: 2025-3-24 09:05 作者: MOCK 時間: 2025-3-24 14:27
Engineering Aspects of Thermal Processing, .. can be computed (“simulated”) in threshold . 2 with polynomial size. In this paper, we modify the method from [GK] to obtain an improvement in two respects: The approach described here is simpler and the size of the simulating circuit is smaller.作者: omnibus 時間: 2025-3-24 18:20
Thermal Processing of Packaged Foodserministic polynomial time algorithm to embed any bipartite graph in .pages. We then use this algorithm to embed, in polynomial time, any graph . in .pages, where δ*(.) is the largest minimum degree over all subgraphs of .. Our algorithms are obtained by derandomizing the probabilistic proofs.作者: pulse-pressure 時間: 2025-3-24 20:37
Heat Penetration in Packaged Foods,nally vertex-disjoint paths between every pair of vertices in .. and two edgedisjoint paths between every pair of vertices in ... We solve the bi-level augmentation problem in .(.) time, where . and . are the numbers of vertices and edges in .. Our algorithm can be parallelized to run in .(log..) time using . processors on an EREW PRAM.作者: 牽索 時間: 2025-3-25 02:09 作者: 細菌等 時間: 2025-3-25 07:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234762.jpg作者: chemoprevention 時間: 2025-3-25 10:05 作者: uncertain 時間: 2025-3-25 11:42 作者: Gullible 時間: 2025-3-25 18:47
Causal Thermal Phenomena in a Planck Era,chine by a certain weight. Jobs also depart on-line. The goal is to minimize the maximum load on any machine, the load being defined as the sum of the weights of the jobs assigned to the machine. The scheduler also has the option of preempting a job and reassigning it to another machine. Whenever a 作者: 擴大 時間: 2025-3-25 21:55 作者: FATAL 時間: 2025-3-26 02:46
Springer Series in Optical Sciencesction routing. Although these two techniques differ significally in the low level structure of information (worms, packets), we derived realistic results using an appropriate simulation model. In our experiments we compared average time, latency and throughput achieved by both deflection and wormhol作者: Flagging 時間: 2025-3-26 05:19
https://doi.org/10.1007/0-387-30234-4at each . columns are linearly independent modulo 2. For fixed integers . ≥ 2 and . ≥ 1, we show the probabilistic lower bound .(.) = Ω(..); for . a power of 2, we prove the upper bound .(.) = .(..), which matches the lower bound for infinitely many values of .. We give some explicit constructions.作者: 奇怪 時間: 2025-3-26 12:27 作者: Estrogen 時間: 2025-3-26 13:44
https://doi.org/10.1007/0-387-30234-4eration, is similar to an existing algorithm for finding such bounds, but exhibits several improvements and optimizations, and hence runs much faster. Using the new approach, we have shown a length lower bound of 19. – 214 for .-reflecting sequences for labeled 7-chains, thus improving the current l作者: 踉蹌 時間: 2025-3-26 18:02 作者: 容易懂得 時間: 2025-3-26 22:28 作者: 煤渣 時間: 2025-3-27 04:12 作者: 航海太平洋 時間: 2025-3-27 08:36 作者: FIN 時間: 2025-3-27 11:44
Heat Penetration in Packaged Foods,d in the counting hierarchy. Thus, [CMTV95] shows that there are problems in ModPH that require superpolynomialsize uniform ACC. circuits, and problems in the counting hierarchy that require superpolynomial-size uniform TC. circuits. The proof in [CMTV95] uses “l(fā)eaf languages” as a tool in obtaining作者: Consequence 時間: 2025-3-27 14:44
Engineering Aspects of Thermal Processing, .. can be computed (“simulated”) in threshold . 2 with polynomial size. In this paper, we modify the method from [GK] to obtain an improvement in two respects: The approach described here is simpler and the size of the simulating circuit is smaller.作者: Synapse 時間: 2025-3-27 18:20 作者: Condyle 時間: 2025-3-27 23:31 作者: cogitate 時間: 2025-3-28 02:47
Thermal Processing of Packaged Foodserministic polynomial time algorithm to embed any bipartite graph in .pages. We then use this algorithm to embed, in polynomial time, any graph . in .pages, where δ*(.) is the largest minimum degree over all subgraphs of .. Our algorithms are obtained by derandomizing the probabilistic proofs.作者: 消耗 時間: 2025-3-28 09:58 作者: Indecisive 時間: 2025-3-28 12:18
Thermal Processing of Packaged Foodsthat use membership and equivalence queries to obtain new learning results only with memberships. In particular we show the exact learuability of read-. monotone formulas, Sat-..(log .)-CDNF, and .-size CDNF from membership queries only.作者: 天氣 時間: 2025-3-28 15:30 作者: Crohns-disease 時間: 2025-3-28 22:17 作者: GIST 時間: 2025-3-29 00:29 作者: progestin 時間: 2025-3-29 03:23 作者: 改革運動 時間: 2025-3-29 08:04
Wormhole versus deflection routing: A case study on the mesh,ction routing. Although these two techniques differ significally in the low level structure of information (worms, packets), we derived realistic results using an appropriate simulation model. In our experiments we compared average time, latency and throughput achieved by both deflection and wormhol作者: offense 時間: 2025-3-29 12:33
On sparse parity check matrices (extended abstract),at each . columns are linearly independent modulo 2. For fixed integers . ≥ 2 and . ≥ 1, we show the probabilistic lower bound .(.) = Ω(..); for . a power of 2, we prove the upper bound .(.) = .(..), which matches the lower bound for infinitely many values of .. We give some explicit constructions.作者: dominant 時間: 2025-3-29 18:08 作者: 鐵砧 時間: 2025-3-29 22:22 作者: thrombosis 時間: 2025-3-30 03:11
Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangementry decision diagram, BDD [12, 13]. This paper extends this approach to counting problems on linear matroids, graphic arrangements and partial orders, most of which are already known to be #P-hard, with using geometric properties. Efficient algorithms are provided to the following problems.作者: glisten 時間: 2025-3-30 08:07 作者: Lignans 時間: 2025-3-30 08:27 作者: disciplined 時間: 2025-3-30 13:16
Area-efficient algorithms for upward straight-line tree drawings,ing four constraints: (1) all vertices are placed at distinct grid points (.), (2) all edges are drawn as straight lines (.), (3) no two edges in the drawing intersect (.), and (4) no parents are placed below their children (.). Our results are summarized as follows. First, we show that a bounded-de作者: Indurate 時間: 2025-3-30 16:44 作者: 古代 時間: 2025-3-30 21:50
A note on the simulation of exponential threshold weights, .. can be computed (“simulated”) in threshold . 2 with polynomial size. In this paper, we modify the method from [GK] to obtain an improvement in two respects: The approach described here is simpler and the size of the simulating circuit is smaller.作者: 避開 時間: 2025-3-31 04:55 作者: 很像弓] 時間: 2025-3-31 06:26 作者: COLON 時間: 2025-3-31 11:36 作者: PTCA635 時間: 2025-3-31 14:45 作者: 嫻熟 時間: 2025-3-31 18:43 作者: wall-stress 時間: 2025-3-31 22:30
Springer Series in Optical Sciences mesh, especially for large networks. Furthermore, although it is hard to analyze simple versions of wormhole routing, it seems that these versions outperform algorithms that are devised in order to simplify theoretical analysis. Finally we implemented and tested an algorithm that combines both deflection and wormhole routing.作者: IRATE 時間: 2025-4-1 03:33