標(biāo)題: Titlebook: Computing and Combinatorics; 10th Annual Internat Kyung-Yong Chwa,J. Ian J. Munro Conference proceedings 2004 Springer-Verlag Berlin Heidel [打印本頁] 作者: 夾子 時(shí)間: 2025-3-21 17:13
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學(xué)科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學(xué)科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學(xué)科排名
作者: 產(chǎn)生 時(shí)間: 2025-3-21 23:43
https://doi.org/10.1007/978-94-009-1027-0lled the Poisson cloning model, in which all degrees are i.i.d Poisson random variables. Similar models may be introduced for random directed graphs and random .-SAT problems. We will first establish theorems saying that the new models are essentially equivalent to the classical models. To demonstra作者: expository 時(shí)間: 2025-3-22 03:35
2.2.2 Significant wind approximations,dows where flow is constrained by transportation schedules and warehouse capacities with the objective to minimize costs, including inventory costs. Transportation is provided through flexible schedules and lot-sizing is dealt with in the models through multiple shipments. We propose polynomial time作者: 暫時(shí)過來 時(shí)間: 2025-3-22 07:36
2.2.2 Significant wind approximations,e .(.) = .. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least ., 作者: ferment 時(shí)間: 2025-3-22 10:32 作者: CURB 時(shí)間: 2025-3-22 16:00
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random ,-SAT Problemslled the Poisson cloning model, in which all degrees are i.i.d Poisson random variables. Similar models may be introduced for random directed graphs and random .-SAT problems. We will first establish theorems saying that the new models are essentially equivalent to the classical models. To demonstra作者: CURB 時(shí)間: 2025-3-22 19:09
Transshipment Through Crossdocks with Inventory and Time Windowsdows where flow is constrained by transportation schedules and warehouse capacities with the objective to minimize costs, including inventory costs. Transportation is provided through flexible schedules and lot-sizing is dealt with in the models through multiple shipments. We propose polynomial time作者: Pantry 時(shí)間: 2025-3-22 21:36 作者: Patrimony 時(shí)間: 2025-3-23 01:49 作者: 縮影 時(shí)間: 2025-3-23 08:26
0302-9743 chedule, and the program committee’s task was extremely di?cult. In addition to selected papers, the conference also included threeinvitedpresentationsbyLarsArg978-3-540-22856-1978-3-540-27798-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 滔滔不絕的人 時(shí)間: 2025-3-23 10:00
Large Triangles in the ,-Dimensional Unit-Cubee [0,1]. such that the minimum (2-dimensional) area of a triangle among these . points is maximal. Denoting this maximum value by Δ..(.) and Δ..(.) for the off-line and the on-line situation, respectively, we will show that .. · (log .)./.. ≤ Δ..(.) ≤ ../.. and ../.. ≤ Δ..(.) ≤ ../.. for constants .., .., .., .. > 0 which depend on . only.作者: Galactogogue 時(shí)間: 2025-3-23 15:59
Necessary and Sufficient Numbers of Cards for the Transformation Protocole transformation protocol to succeed was known. However, it has been an open problem to obtain a necessary and sufficient condition. This paper improves the transformation protocol and gives a necessary and sufficient condition for the improved transformation protocol to succeed.作者: 好開玩笑 時(shí)間: 2025-3-23 18:50 作者: languid 時(shí)間: 2025-3-23 23:50 作者: 影響深遠(yuǎn) 時(shí)間: 2025-3-24 04:38 作者: 愚蠢人 時(shí)間: 2025-3-24 08:49
https://doi.org/10.1007/b99243Automat; algorithms; automata; combinatorial optimization; complexity; complexity theory; computational ge作者: 閃光東本 時(shí)間: 2025-3-24 11:35 作者: subacute 時(shí)間: 2025-3-24 18:26
C. Colinet,A. Bessoud,A. Pasturelmically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major performance bottleneck. Many massive dataset applications 作者: Landlocked 時(shí)間: 2025-3-24 20:21
https://doi.org/10.1007/978-94-009-1027-0). Though this fact is useful to understand the nature of the model, it has not been possible to fully utilize properties of i.i.d Poisson random variables. For example, the distribution of the number of isolated vertices is very close to the binomial distribution .(., ..). In a rigorous proof, howe作者: tenosynovitis 時(shí)間: 2025-3-25 02:18
Thermodynamic Equilibria and Extremas one of the most successful principle for designing robust algorithms to solve geometric problems, which the author’s group has been developed for a long time. This approach generates efficient algorithms because the floating-point arithmetic can be used, but is not a beginners’ technique because t作者: 薄膜 時(shí)間: 2025-3-25 06:10
Thermodynamic Equilibria and Extremaal path lengths)..The combinatorial structure of the Huffman tree depends on the weights of keys, and thus the space of weights is tessellated into regions called . associated with the combinatorial structures. In this paper we investigate properties of this tessellation..We show that each optimal r作者: Encoding 時(shí)間: 2025-3-25 09:02
Thermodynamic Modeling on Graphs,al optimally universal hash families, if the cardinalities of the universe and the range are powers of the same prime. A corollary of this result is that the necessary condition for the existence of an RBIBD with parameters (.,.,.), namely . mod . = .(.–1) mod (.–1) = 0, is sufficient, if . and . ar作者: Mindfulness 時(shí)間: 2025-3-25 12:16
Thermodynamic Equilibria and Extrema Block Sorting was shown in [2] to be NP-hard. In this article, we improve upon the ideas used in [6] to obtain a combinatorial characterization of the optimal solutions of SBSM. Using this, we show that a strip move which results in a permutation of two or three fewer strips or which exchanges a pa作者: Flat-Feet 時(shí)間: 2025-3-25 16:38 作者: HOWL 時(shí)間: 2025-3-25 20:47 作者: 可卡 時(shí)間: 2025-3-26 02:59 作者: sed-rate 時(shí)間: 2025-3-26 06:46 作者: Fillet,Filet 時(shí)間: 2025-3-26 09:25
Design Optimization Using Exergoeconomics,p to a finite number of the answers may be erroneous/mendacious. In the variant considered in this paper, questions with . many possible answers are allowed, with . fixed and known beforehand; further, lies are constrained by a weighted bipartite graph (the “channel”). We provide a tight asymptotic 作者: Vldl379 時(shí)間: 2025-3-26 14:22
Exergy in the Thermal Systems Analysis,e transformation protocol to succeed was known. However, it has been an open problem to obtain a necessary and sufficient condition. This paper improves the transformation protocol and gives a necessary and sufficient condition for the improved transformation protocol to succeed.作者: 手銬 時(shí)間: 2025-3-26 18:05 作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-27 00:27
1.6 Books on dynamical meteorology,ly good approximation algorithm for the minimum normalized cut problem. (2) serves as an important application of (1). Our experimental results show that the output quality of our approach compares favorably against some previous approximation multicommodity flow implementation and eigenvalue/eigenv作者: instulate 時(shí)間: 2025-3-27 03:50 作者: saturated-fat 時(shí)間: 2025-3-27 05:32 作者: 密切關(guān)系 時(shí)間: 2025-3-27 09:49 作者: 圓木可阻礙 時(shí)間: 2025-3-27 17:16
2.2.2 Significant wind approximations,ts a node . ∈ . such that it is not adjacent to any node in .. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (.,.) in a chordal graph ., there exists a clique with .(.) + 1作者: 審問,審訊 時(shí)間: 2025-3-27 21:25 作者: 易改變 時(shí)間: 2025-3-27 22:12 作者: 無能性 時(shí)間: 2025-3-28 02:28 作者: 大包裹 時(shí)間: 2025-3-28 06:54
Exergy in the Thermal Systems Analysis,e transformation protocol to succeed was known. However, it has been an open problem to obtain a necessary and sufficient condition. This paper improves the transformation protocol and gives a necessary and sufficient condition for the improved transformation protocol to succeed.作者: 死亡 時(shí)間: 2025-3-28 14:26
2.3.2 Elementary constants and functions, .=(.,.) with weight function .. In this paper, we show that a weak vertex cover set approximating a minimum one within . can be efficiently found in undirected graphs, and improve the previous work of approximation ratio within ln . + 1, where . is the maximum degree of the vertex in graph ..作者: 小樣他閑聊 時(shí)間: 2025-3-28 15:25 作者: 鑲嵌細(xì)工 時(shí)間: 2025-3-28 19:45 作者: Cpr951 時(shí)間: 2025-3-29 02:58
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random ,-SAT Problems). Though this fact is useful to understand the nature of the model, it has not been possible to fully utilize properties of i.i.d Poisson random variables. For example, the distribution of the number of isolated vertices is very close to the binomial distribution .(., ..). In a rigorous proof, howe作者: 表皮 時(shí)間: 2025-3-29 03:47 作者: Heterodoxy 時(shí)間: 2025-3-29 10:16
Adjacency of Optimal Regions for Huffman Treesal path lengths)..The combinatorial structure of the Huffman tree depends on the weights of keys, and thus the space of weights is tessellated into regions called . associated with the combinatorial structures. In this paper we investigate properties of this tessellation..We show that each optimal r作者: 散開 時(shí)間: 2025-3-29 11:56 作者: 叢林 時(shí)間: 2025-3-29 17:14
Towards Constructing Optimal Strip Move Sequences Block Sorting was shown in [2] to be NP-hard. In this article, we improve upon the ideas used in [6] to obtain a combinatorial characterization of the optimal solutions of SBSM. Using this, we show that a strip move which results in a permutation of two or three fewer strips or which exchanges a pa作者: 合法 時(shí)間: 2025-3-29 22:17
Large Triangles in the ,-Dimensional Unit-Cubee [0,1]. such that the minimum (2-dimensional) area of a triangle among these . points is maximal. Denoting this maximum value by Δ..(.) and Δ..(.) for the off-line and the on-line situation, respectively, we will show that .. · (log .)./.. ≤ Δ..(.) ≤ ../.. and ../.. ≤ Δ..(.) ≤ ../.. for constants .作者: Commodious 時(shí)間: 2025-3-30 02:12 作者: 極深 時(shí)間: 2025-3-30 04:35 作者: Blatant 時(shí)間: 2025-3-30 09:07
Some Open Problems in Decidability of Brick (Labelled Polyomino) Codesnt sets. Here we consider sets consisting of square bricks only. We show that in this setting, the codicity of small sets (two bricks) is decidable, but 15 bricks are enough to make the problem undecidable. Thus the frontier between decidability and undecidability lies somewhere between these two nu作者: FIR 時(shí)間: 2025-3-30 14:26
,-Ary Ulam-Rényi Game with Weighted Constrained Liesp to a finite number of the answers may be erroneous/mendacious. In the variant considered in this paper, questions with . many possible answers are allowed, with . fixed and known beforehand; further, lies are constrained by a weighted bipartite graph (the “channel”). We provide a tight asymptotic 作者: 收集 時(shí)間: 2025-3-30 17:34 作者: 激怒某人 時(shí)間: 2025-3-30 21:33
On the Selection and Assignment with Minimum Quantity Commitmentsapacity and the fixed selection costs are two major restrictions imposed on suppliers, and extensively studied in literature..In practice, another constraint, named as Minimum Quantity Commitment (MQC), needs to be satisfied by each selected supplier. It is stipulated for the global transportation b作者: Subjugate 時(shí)間: 2025-3-31 03:46
Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Exly good approximation algorithm for the minimum normalized cut problem. (2) serves as an important application of (1). Our experimental results show that the output quality of our approach compares favorably against some previous approximation multicommodity flow implementation and eigenvalue/eigenv作者: grieve 時(shí)間: 2025-3-31 06:56
Transshipment Through Crossdocks with Inventory and Time Windows meet supply has been to coordinate transshipment activities across the chain aimed at reducing costs and increasing service levels in the face of a range of factors, including demand fluctuations, short lead times, warehouse limitations and transportation and inventory costs. The success in impleme作者: Comedienne 時(shí)間: 2025-3-31 13:06 作者: Presbycusis 時(shí)間: 2025-3-31 14:05 作者: 危險(xiǎn) 時(shí)間: 2025-3-31 21:28 作者: Needlework 時(shí)間: 2025-4-1 00:46 作者: A保存的 時(shí)間: 2025-4-1 02:03
1.6 Books on dynamical meteorology,ies for them to seek the optimal schedule with minimum total costs. The MQC constraint has been seldom studied before, which motivates us to present its hardness results for the selection and assignment problems.作者: Arb853 時(shí)間: 2025-4-1 07:58
