標(biāo)題: Titlebook: Algorithms and Computation; 9th International Sy Kyung-Yong Chwa,Oscar H. Ibarra Conference proceedings 1998 Springer-Verlag Berlin Heidelb [打印本頁] 作者: choleric 時(shí)間: 2025-3-21 16:13
書目名稱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é)科排名
作者: Comprise 時(shí)間: 2025-3-21 20:14 作者: 做作 時(shí)間: 2025-3-22 02:57
On-Line Scheduling of Parallel Jobs with Runtime Restrictionsing algorithms for various interconnection topologies that use some a priori information about the job running times or guarantee a good competitive ratio that depends on the runtime ratio of all generated jobs. All algorithms presented in this paper have optimal competitive ratio up to small additive constants.作者: Ballerina 時(shí)間: 2025-3-22 07:04 作者: 積習(xí)已深 時(shí)間: 2025-3-22 12:25 作者: 拋棄的貨物 時(shí)間: 2025-3-22 15:58
Ausblick: Theoretische Implikationenrnative. Using the .. Voronoi diagram of polygons we address the problem of calculating the . for shorts in a VLSI layout. The critical area computation is the main computational problem in VLSI yield prediction.作者: Coeval 時(shí)間: 2025-3-22 18:50 作者: 小溪 時(shí)間: 2025-3-22 22:24 作者: palliative-care 時(shí)間: 2025-3-23 03:40 作者: paltry 時(shí)間: 2025-3-23 06:02
Konsumsoziologie und Massenkulturn of an mage as a collection of contour lines for ntensitylevels this problem is naturally defined as one of reconnect ng those contour lines disconnected by a flaw region. An efficient algorithm for reconnecting contour lines is presented based on perfect matching and observations on geometric properties of interconnection paths.作者: 改良 時(shí)間: 2025-3-23 13:08
Forschungen zur Europ?ischen Integration the deep mathematical techniques of discrepancy theory might be of utility to theoretical computer scientists. As will be discussed in this talk this is, indeed, the case. We will give several examples of breakthroughs derived through the application of the “discrepancy method.”作者: Flagging 時(shí)間: 2025-3-23 14:17 作者: 旋轉(zhuǎn)一周 時(shí)間: 2025-3-23 19:21 作者: MUTED 時(shí)間: 2025-3-23 23:38
https://doi.org/10.1007/978-3-322-80507-2 representations of Horn theories, namely for Horn CNFs and characteristic models. While the problems are shown to be intractable in general, we present polynomial time algorithms for bounded disjunctions in the formula-based case.作者: 地名表 時(shí)間: 2025-3-24 05:56
,?Wie immer man sich entscheidet …“,mily . ?-) 2. such that P is characterized by z ∈ ?..|Σ. z(.) ≤ . Based on this, we can solve in polynomial time the edge-connectivity augmentation problem with an additional constraint that the number of vertices to which new edges are incident is minimized.作者: 褻瀆 時(shí)間: 2025-3-24 10:20
The Discrepancy Method the deep mathematical techniques of discrepancy theory might be of utility to theoretical computer scientists. As will be discussed in this talk this is, indeed, the case. We will give several examples of breakthroughs derived through the application of the “discrepancy method.”作者: 國(guó)家明智 時(shí)間: 2025-3-24 12:15 作者: capsaicin 時(shí)間: 2025-3-24 18:42 作者: 倫理學(xué) 時(shí)間: 2025-3-24 19:35 作者: octogenarian 時(shí)間: 2025-3-24 23:41
Polyhedral Structure of Submodular and Posi-modular Systemsmily . ?-) 2. such that P is characterized by z ∈ ?..|Σ. z(.) ≤ . Based on this, we can solve in polynomial time the edge-connectivity augmentation problem with an additional constraint that the number of vertices to which new edges are incident is minimized.作者: ITCH 時(shí)間: 2025-3-25 04:44
1648: Prahlen, drohen, schmierenl, . (κ)is κ - competitive for κ>2. This is the first class of algorithms that is asymptotically optima for independent, identically distributed requests while each algorithm is constant-competitive..Empirical studies with with both generated and real-world data are also included.作者: 粉筆 時(shí)間: 2025-3-25 10:49 作者: Obvious 時(shí)間: 2025-3-25 15:40
Two New Families of List Update Algorithmsl, . (κ)is κ - competitive for κ>2. This is the first class of algorithms that is asymptotically optima for independent, identically distributed requests while each algorithm is constant-competitive..Empirical studies with with both generated and real-world data are also included.作者: Asseverate 時(shí)間: 2025-3-25 16:49
Casting with Skewed Ejection Directionion directions need not be the same. For polyhedral objects, we show that the test can be performed in .(..log .) time and the cast parts can be constructed within the same time bound. We also give a polynomial time algorithm for finding a feasible pair of retraction and ejection directions for a given polyhedral object.作者: Mnemonics 時(shí)間: 2025-3-25 23:28
Kyung-Yong Chwa,Oscar H. IbarraIncludes supplementary material: 作者: 免費(fèi) 時(shí)間: 2025-3-26 04:08
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153117.jpg作者: 圣人 時(shí)間: 2025-3-26 05:34
Forschungen zur Europ?ischen Integrationt approximates it well. As it turns out, many questions in complexity theory can be reduced to problems of that type. This raises the possibility that the deep mathematical techniques of discrepancy theory might be of utility to theoretical computer scientists. As will be discussed in this talk this作者: –LOUS 時(shí)間: 2025-3-26 10:21
Zur Einflusslogik externer Faktoren discuss educational and research issues in algorithm engineering. Topics include algorithmic patterns, the development of a library of data structures and algorithms in Java, and the use of design patters in teaching introductory data structures courses.作者: FIG 時(shí)間: 2025-3-26 15:29 作者: Notorious 時(shí)間: 2025-3-26 20:41
Der Konflikt um Windenergie in Mexikoimizes the maximum distance to the sites. The distance is measured as the length of the Euclidean shortest path along the terrain. To simplify the problem somewhat, we extend the terrain to (the surface of) a polyhedron. To compute the optimum placement, we compute the furthest-site Voronoi diagram 作者: HPA533 時(shí)間: 2025-3-26 22:49 作者: degradation 時(shí)間: 2025-3-27 01:58 作者: Biofeedback 時(shí)間: 2025-3-27 05:56
https://doi.org/10.1007/978-3-658-04148-9aximum weight in a given two-layer graph. Depending on the number of layers in which the vertices can be permuted freely, that is, zero, one or two, different versions of the problems arise. The latter problem was already investigated in . using polyhedral combinatorics. Here, we study the remaining作者: 熟練 時(shí)間: 2025-3-27 11:05
Sicherheit im Umgang mit Unsicherheitof bends, by considering all possible planar embeddings of the graph. While the general problem has been shown to be .-complete [7], polynomial time algorithms have been devised for graphs whose vertex degree is at most three [5]. We show the first algorithm whose time complexity is exponential only作者: 聲明 時(shí)間: 2025-3-27 15:28 作者: Gleason-score 時(shí)間: 2025-3-27 21:34 作者: Lasting 時(shí)間: 2025-3-27 22:31
,Ausblick – Die Zukunft von CX?, of the sequence onto . stack-up places. We prove that the Most-Frequently algorithm has best worst-case performance of all . stack-up algorithms and is, additionally, the best polynomial time approximation algorithm for the stack-up problem known up to now, although it is a simple . algorithm.作者: Vasodilation 時(shí)間: 2025-3-28 04:26 作者: 老人病學(xué) 時(shí)間: 2025-3-28 06:25
https://doi.org/10.1007/978-3-642-86142-0ed is a disk and it’s center is known, we describe a procedure which uses .(.)pobesand .(.)computation time. (Here n = |1 /q |, whee q is the quality of the object.)When the center of the object is not known, a procedure using O (n )pobesand O (n log n ) computation time is described. When the objec作者: subordinate 時(shí)間: 2025-3-28 13:14 作者: FUSC 時(shí)間: 2025-3-28 17:39
Konsumsoziologie und Massenkultur with white and then to move those pixels in the neighborhood byusing a tool called an copy-brush. Since it is a very fine operation, it causes great effort to human operators. It is not easy to automate this operation in the existing matrix representation of an image. In our geometric representatio作者: BRACE 時(shí)間: 2025-3-28 22:21
Konsum zwischen Risiko und Gefahr,y the smallest number of new edges so that the resulting multigraph becomes l-edge-connected and k-vertex-connected. In this paper, we show that the problem with a fixed and k = 3 can be solved in polynomial time for an arbitrary multigraph G作者: neutral-posture 時(shí)間: 2025-3-29 02:02
,?Wie immer man sich entscheidet …“, and posi-modular set function .: 2. → ∈, where ∈.. denotes the set of |V |-dimensional nonpositive vectors. We first prove that there is a laminar family . ?-) 2. such that P is characterized by z ∈ ?..|Σ. z(.) ≤ . Based on this, we can solve in polynomial time the edge-connectivity augmentation pr作者: 使混合 時(shí)間: 2025-3-29 05:49
Algorithms and Computation978-3-540-49381-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Institution 時(shí)間: 2025-3-29 09:06
0302-9743 Overview: Includes supplementary material: 978-3-540-65385-1978-3-540-49381-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使聲音降低 時(shí)間: 2025-3-29 12:47
Zur Einflusslogik externer Faktoren discuss educational and research issues in algorithm engineering. Topics include algorithmic patterns, the development of a library of data structures and algorithms in Java, and the use of design patters in teaching introductory data structures courses.作者: 厚臉皮 時(shí)間: 2025-3-29 16:53 作者: 倔強(qiáng)不能 時(shí)間: 2025-3-29 20:07
Konsum zwischen Risiko und Gefahr,y the smallest number of new edges so that the resulting multigraph becomes l-edge-connected and k-vertex-connected. In this paper, we show that the problem with a fixed and k = 3 can be solved in polynomial time for an arbitrary multigraph G作者: Orchiectomy 時(shí)間: 2025-3-30 02:51 作者: Culmination 時(shí)間: 2025-3-30 07:29
An Optimal Algorithm for On-Line Palletizing at Delivery Industry of the sequence onto . stack-up places. We prove that the Most-Frequently algorithm has best worst-case performance of all . stack-up algorithms and is, additionally, the best polynomial time approximation algorithm for the stack-up problem known up to now, although it is a simple . algorithm.作者: gorgeous 時(shí)間: 2025-3-30 08:20 作者: consolidate 時(shí)間: 2025-3-30 16:13 作者: Lament 時(shí)間: 2025-3-30 16:32 作者: 大約冬季 時(shí)間: 2025-3-30 22:02
Der Konflikt um Windenergie in MexikoGiven a set . of obstacles and a set . of source points in the plane, the problem of finding a set of points subject to a certain objective function with respect to . and . is a basic problem in applications such as facility location problem ..作者: 殺人 時(shí)間: 2025-3-31 03:09 作者: 結(jié)構(gòu) 時(shí)間: 2025-3-31 05:52
Computing Weighted Rectilinear Median and Center Set in the Presence of ObstaclesGiven a set . of obstacles and a set . of source points in the plane, the problem of finding a set of points subject to a certain objective function with respect to . and . is a basic problem in applications such as facility location problem ..作者: intertwine 時(shí)間: 2025-3-31 11:44
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing ItWe formalize and investigate a model for zero-knowledge proofs of “program result-correctness”, which naturally extends Blum’s theory of program checking by adding zero-knowledge requirements. The zero-knowledge requirements are universal for yes and no instances alike.作者: 大氣層 時(shí)間: 2025-3-31 16:45
The Discrepancy Methodt approximates it well. As it turns out, many questions in complexity theory can be reduced to problems of that type. This raises the possibility that the deep mathematical techniques of discrepancy theory might be of utility to theoretical computer scientists. As will be discussed in this talk this作者: ungainly 時(shí)間: 2025-3-31 17:47
Implementing Algorithms and Data Structures: An Educational and Research Perspective discuss educational and research issues in algorithm engineering. Topics include algorithmic patterns, the development of a library of data structures and algorithms in Java, and the use of design patters in teaching introductory data structures courses.作者: 孤僻 時(shí)間: 2025-4-1 01:29
Voronoi Diagrams and Applications to VLSI Layout and Manufacturing Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly important the .. Voronoi diagram can provide a better alte作者: Anhydrous 時(shí)間: 2025-4-1 05:51 作者: 埋葬 時(shí)間: 2025-4-1 07:58 作者: Bumble 時(shí)間: 2025-4-1 12:33
