作者: immunity 時(shí)間: 2025-3-21 21:30
https://doi.org/10.1007/978-3-531-91060-4an their descendants. We investigate several variants of the problem, differing from one another by whether jobs are . or .; whether they are . or .; and whether assignments are ..We derive upper and lower bounds on the competitive ratio.作者: 朦朧 時(shí)間: 2025-3-22 01:34 作者: affluent 時(shí)間: 2025-3-22 08:08
Drei Dokumente des Europarates,hen applied to various types of resource-constrained project scheduling problems. An extensive computational study based on different established test beds in project scheduling shows that it can significantly improve upon the quality of other comparably fast computable lower bounds.作者: ALIEN 時(shí)間: 2025-3-22 09:51 作者: Highbrow 時(shí)間: 2025-3-22 13:04 作者: 正論 時(shí)間: 2025-3-22 17:03 作者: extract 時(shí)間: 2025-3-22 22:11 作者: 挖掘 時(shí)間: 2025-3-23 02:30
Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems,hen applied to various types of resource-constrained project scheduling problems. An extensive computational study based on different established test beds in project scheduling shows that it can significantly improve upon the quality of other comparably fast computable lower bounds.作者: 強(qiáng)制性 時(shí)間: 2025-3-23 08:26
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstracctively. The second algorithm is designed for a ‘natural’ subclass of proteins, which covers more than 99:5% of all sequenced proteins. This is the first time that a protein structure prediction algorithm is designed for a ‘natural’ subclass of all combinatorially possible sequences.作者: ticlopidine 時(shí)間: 2025-3-23 11:11 作者: Uncultured 時(shí)間: 2025-3-23 15:50
Forschungen aus Staat und Rechtent a polynomial time approximation scheme for the case in which the number of machines is fixed.We also show that for the case in which the number of machines is given as part of the input (i.e., not fixed), no algorithm can achieve a better approximation ratio than 4/3 unless . = ..作者: Monolithic 時(shí)間: 2025-3-23 20:58 作者: 大罵 時(shí)間: 2025-3-24 00:00 作者: Indolent 時(shí)間: 2025-3-24 02:23 作者: Bone-Scan 時(shí)間: 2025-3-24 08:22 作者: 不能平靜 時(shí)間: 2025-3-24 10:50 作者: guardianship 時(shí)間: 2025-3-24 14:59 作者: dandruff 時(shí)間: 2025-3-24 20:01 作者: chondromalacia 時(shí)間: 2025-3-25 01:34 作者: Abbreviate 時(shí)間: 2025-3-25 06:47 作者: Friction 時(shí)間: 2025-3-25 10:53 作者: 的闡明 時(shí)間: 2025-3-25 14:07 作者: extinct 時(shí)間: 2025-3-25 19:39
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines,We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times, including minimizing the . . norm of the vector of completion times. This generalizes and simplifies many previous results in this area.作者: 愚笨 時(shí)間: 2025-3-25 21:03 作者: Veneer 時(shí)間: 2025-3-26 00:10
,On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help,an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more efficient than evolutionary algorithms without crossover. In this paper, such an example is presented and its properties are proved.作者: cluster 時(shí)間: 2025-3-26 04:51
Algorithms - ESA‘99978-3-540-48481-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 眼界 時(shí)間: 2025-3-26 12:22 作者: Inflated 時(shí)間: 2025-3-26 15:35
Gegenwart und Zukunft des Europarates,an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more efficient than evolutionary algorithms without crossover. In this paper, such an example is presented and its properties are proved.作者: 逗留 時(shí)間: 2025-3-26 19:17
https://doi.org/10.1007/978-3-531-91060-4ntire view of the protocol including the entire communication history. Proving security of cryptographic protocols against adaptive adversaries is a fundamental problem in cryptography. In this paper we consider “distributed public-key systems” which are secure against an adaptive adversary.作者: 矛盾 時(shí)間: 2025-3-26 23:12 作者: Dorsal-Kyphosis 時(shí)間: 2025-3-27 02:40
https://doi.org/10.1007/978-3-531-91060-4ign and scheduling. The input consists of a set of markets and a set of products. Each market offers a price for each product and there is a cost associated with traveling from one market to another. The problem is to purchase all products by visiting a subset of the markets in a tour such that the 作者: CAMP 時(shí)間: 2025-3-27 05:26
https://doi.org/10.1007/978-3-531-91060-4given transmission range. All nodes located within this range can receive messages from .. However, a node situated in the range of two or more nodes that send messages simultaneously, cannot receive these messages and hears only noise. Each node knows only its own position and range, as well as the作者: 四目在模仿 時(shí)間: 2025-3-27 10:14 作者: Morphine 時(shí)間: 2025-3-27 14:58
Kongress der Gemeinden und Regionen, general terms of longest prefix matching and, then, are experimented on real routing tables .. In this paper, we follow the opposite direction. We start out from the experimental analysis of real data and, based upon our findings, we provide a new and simple solution to the IP address lookup proble作者: superfluous 時(shí)間: 2025-3-27 18:03
https://doi.org/10.1007/978-3-531-91060-4b requests a specific server meeting its needs but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job carries a certain load, which it imparts to the server to which it is assigned. The goal is to minimize the maximum total load on a server作者: gout109 時(shí)間: 2025-3-27 23:05
Kongress der Gemeinden und Regionen,organized in indivisible objects such as files, pages, or global variables. The data objects can be replicated and discarded over time in order to minimize the communication load for read and write accesses done by the nodes in the network. Non-uniform data management is characterized by a different作者: 菊花 時(shí)間: 2025-3-28 04:10
Der Europarat und Russland 1992 – 2006 in the event of a failure. Planning the spare capacity so as to minimize cost is an NP-hard problem, and for large networks, even the linear relaxation is too large to be solved with existing methods. The main contribution of this paper is a fast algorithm for restoration capacity planning with a p作者: cravat 時(shí)間: 2025-3-28 06:30 作者: Paraplegia 時(shí)間: 2025-3-28 11:44
Drei Dokumente des Europarates,ob is located on some machine in the network and cannot be started on another machine until sufficient time elapses to allow the job to be transmitted there. This setting has applications, e. g., in distributed multi-processor computing environments and also in operations research; it can be modeled作者: Deceit 時(shí)間: 2025-3-28 15:39 作者: 字形刻痕 時(shí)間: 2025-3-28 21:11
Forschungen aus Staat und Rechtan arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time..We pres作者: Essential 時(shí)間: 2025-3-29 01:44
Forschungen aus Staat und Recht processed in parallel (with reasonable overhead due to additional communication). In practice it is often easier to repeatedly bisect jobs, i.e., split one job into exactly two subjobs, than to generate . subjobs at once. In order to balance the load among the . machines, we want to minimize the si作者: Feckless 時(shí)間: 2025-3-29 04:43
Gegenwart und Zukunft des Europarates,an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more efficient than evolutionary algorithms without crossover. In this paper, such an example is presented and its properties are proved.作者: 無(wú)脊椎 時(shí)間: 2025-3-29 10:44
Anwendung der EU-Vorschriften im Vollzug,y used in computational biology. Our approach is based on: (.) classical constructive results in theoretical computer science (automata and formal language theory); (.) analytic combinatorics to compute asymptotic properties from generating functions; (.) computer algebra to determine generating fun作者: Mucosa 時(shí)間: 2025-3-29 13:57
Anwendung der EU-Vorschriften im Vollzug,sequence. In this paper, we design approximation algorithms for structure prediction in the so-called HP side chain model. The major drawback of the standard HP side chain model is the bipartiteness of the cubic lattice. To eliminate this drawback, we introduce the extended cubic lattice which exten作者: 暗指 時(shí)間: 2025-3-29 16:33 作者: 寄生蟲 時(shí)間: 2025-3-29 22:47 作者: 不能逃避 時(shí)間: 2025-3-30 01:48 作者: Ardent 時(shí)間: 2025-3-30 06:32 作者: Diluge 時(shí)間: 2025-3-30 09:05
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing,ps with high probability using queues of constant size. The previous bound is 0:5. + .(.) but needs the queue-size of .(.). An important merit of this algorithm is to give us improved bounds by applying several schemes of faultymesh routing. For example, the scheme by [.], originally .(. log .) time作者: 巡回 時(shí)間: 2025-3-30 12:35 作者: infinite 時(shí)間: 2025-3-30 17:37
On-Line Load Balancing in a Hierarchical Server Topology,b requests a specific server meeting its needs but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job carries a certain load, which it imparts to the server to which it is assigned. The goal is to minimize the maximum total load on a server作者: mortgage 時(shí)間: 2025-3-30 21:02 作者: 財(cái)產(chǎn) 時(shí)間: 2025-3-31 01:45 作者: 拍下盜公款 時(shí)間: 2025-3-31 06:20 作者: Hiatal-Hernia 時(shí)間: 2025-3-31 09:51 作者: floodgate 時(shí)間: 2025-3-31 16:37 作者: insurrection 時(shí)間: 2025-3-31 20:55
Off-Line Temporary Tasks Assignment,an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time..We pres作者: 步兵 時(shí)間: 2025-3-31 22:16
,Load Balancing Using Bisectors — A Tight Average-Case Analysis, processed in parallel (with reasonable overhead due to additional communication). In practice it is often easier to repeatedly bisect jobs, i.e., split one job into exactly two subjobs, than to generate . subjobs at once. In order to balance the load among the . machines, we want to minimize the si作者: 樂(lè)意 時(shí)間: 2025-4-1 05:20
,On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help,an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more efficient than evolutionary algorithms without crossover. In this paper, such an example is presented and its properties are proved.
