標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; Second International Siu-Wing Cheng,Chung Keung Poon Conference proceedings 2006 Springe [打印本頁(yè)] 作者: Clique 時(shí)間: 2025-3-21 18:00
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management影響因子(影響力)
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management被引頻次
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management年度引用
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management讀者反饋
書(shū)目名稱(chēng)Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: 使糾纏 時(shí)間: 2025-3-21 20:44
Densities of Aliphatic Hydrocarbons: Alkaness of a set of four sided Wang tiles whose sides are each associated with a type of glue. The bonding strength between any two glues is determined by a .. A special tile in the tile set is denoted as the . tile. Assembly takes place by starting with the seed tile and attaching copies of tiles from th作者: 朋黨派系 時(shí)間: 2025-3-22 01:02
Densities of Aliphatic Hydrocarbons: Alkanesformation on the source is presented. The server does not have the information on the destination until it reaches the source of the request. This models, e.g. the taxi problem, or elevator problem. We study the problem in the . metric space and . metric space. We perform competitive analysis of two作者: chemoprevention 時(shí)間: 2025-3-22 08:32 作者: 激怒 時(shí)間: 2025-3-22 09:12 作者: pantomime 時(shí)間: 2025-3-22 15:27
Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Modelformation on the source is presented. The server does not have the information on the destination until it reaches the source of the request. This models, e.g. the taxi problem, or elevator problem. We study the problem in the . metric space and . metric space. We perform competitive analysis of two作者: 制定法律 時(shí)間: 2025-3-22 19:24 作者: 他姓手中拿著 時(shí)間: 2025-3-22 23:01 作者: 洞察力 時(shí)間: 2025-3-23 02:53 作者: 一美元 時(shí)間: 2025-3-23 08:59
Throwing Stones Inside Simple Polygonson with complexity?., we can answer such “stone throwing” queries in .(log..) time, using .(. log.) space and .(. log..) preprocessing time. This matches the best known bound for circular ray shooting in simple polygons.作者: PTCA635 時(shí)間: 2025-3-23 13:27 作者: Gum-Disease 時(shí)間: 2025-3-23 16:09 作者: Breach 時(shí)間: 2025-3-23 19:00 作者: Palpable 時(shí)間: 2025-3-24 01:39 作者: 相容 時(shí)間: 2025-3-24 05:21 作者: Hla461 時(shí)間: 2025-3-24 09:03
Densities of Aliphatic Hydrocarbons: Alkaneslevision shopping channels and Internet e-tailers who advertise their products and prices by sending e-mails to potential buyers or by means of popup windows. This paper makes endogenous both firm advertising and price strategies in the model.作者: Essential 時(shí)間: 2025-3-24 14:27
5 Miscellaneous Compounds, CnH(2n-6),re .. is a constant for fixed .. In particular, .. = 1.209. To our best knowledge, this is the first sublinear time algorithm for finding geometric separators. Our 3D separator is applied to derive an algorithm for the protein side-chain packing problem, which improves and simplifies the previous algorithm of Xu [26].作者: Misnomer 時(shí)間: 2025-3-24 18:09 作者: ARIA 時(shí)間: 2025-3-24 20:52
Atomic Routing Games on Maximum Congestion the network. In particular, . = .(?+ log.), where ? is the length of the longest path in the player strategy sets, and . is the size of the network. Further, .– 1 ≤. ≤. (.. + log..), where . is the length of the longest cycle in the network, and . is a constant.作者: OREX 時(shí)間: 2025-3-24 23:53 作者: 神化怪物 時(shí)間: 2025-3-25 06:51 作者: troponins 時(shí)間: 2025-3-25 10:16 作者: 使迷惑 時(shí)間: 2025-3-25 14:12 作者: semble 時(shí)間: 2025-3-25 15:52
Densities of Aliphatic Hydrocarbons: Alkanesxtensively studied while little is known for multiple machines. Our main result is deriving a nontrivial optimal online algorithm with competitive ratio . for the two-machine case by carefully investigating various strategies. Deterministic lower bounds for the general case are also given.作者: Crepitus 時(shí)間: 2025-3-25 22:50
Densities of Aliphatic Hydrocarbons: Alkanesits processing time before meeting its deadline. This paper is concerned with multiple machines. We provide a .-competitive algorithm defined on multiple machines. Also we consider arbitrary value density, where jobs have arbitrary weights. We derive online scheduling algorithms on a single machine as well as on multiple machines.作者: 匍匐 時(shí)間: 2025-3-26 02:37
Densities of Aliphatic Hydrocarbons: Alkanest Service (DRR-IS), and analyze it. We prove that the DRR-IS is still an . server. We calculate its latency and investigate its fairness characteristics. We demonstrate the DRR-IS, compared with DRR, provides about 30% better latency while have the same complexity and the same fairness.作者: Substitution 時(shí)間: 2025-3-26 04:50 作者: Maximizer 時(shí)間: 2025-3-26 09:24
Online Scheduling on Parallel Machines with Two GoS Levelspectively, and every job has a GoS level of 1 alternatively or 2. We first prove the lower bound of the problem under consideration is at least 2. Then we discuss the performance of algorithm . presented in [2] for the problem and show it has a tight bound of 4 – 1/.. Finally, We present an approximation algorithm with a competitive ratio of ..作者: Palate 時(shí)間: 2025-3-26 13:34 作者: agglomerate 時(shí)間: 2025-3-26 18:58 作者: parallelism 時(shí)間: 2025-3-26 21:48 作者: 譏笑 時(shí)間: 2025-3-27 01:43 作者: 親密 時(shí)間: 2025-3-27 07:14 作者: vitrectomy 時(shí)間: 2025-3-27 13:19
Algorithmic DNA Self-assemblynderstood from mathematical and programming perspectives. It is believed that self-assembly technology will ultimately permit the precise fabrication of complex nanostructures. Of particular interest is DNA self-assembly. Double and triple crossover DNA molecules have been designed that can act as f作者: MIME 時(shí)間: 2025-3-27 15:32 作者: 毗鄰 時(shí)間: 2025-3-27 19:15
Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Modelth some finite capacity is required to transports a specified amount of goods for requests from the sources to the destinations. Calls for rides come in while the server is travelling. Each request also specifies a deadline. If a request is not be served by its deadline, it will be called off. The s作者: crumble 時(shí)間: 2025-3-27 23:39 作者: audiologist 時(shí)間: 2025-3-28 05:51
Maximizing the Throughput of Multiple Machines On-Lineof jobs completed by their deadlines. As a special case, the weights may be given as the processing times of jobs, where the job instance is said to have ...Most previous work of nonpreemptively scheduling jobs online concentrates on a single machine and uniform value density. For the single machine作者: 郊外 時(shí)間: 2025-3-28 09:56 作者: 招募 時(shí)間: 2025-3-28 11:03 作者: 冷淡周邊 時(shí)間: 2025-3-28 18:22
Equilibrium Distribution of Advertising Pricesld by means of advertising instead. Applications of this model can be found on numerous sales activities include, for example, insurance companies, television shopping channels and Internet e-tailers who advertise their products and prices by sending e-mails to potential buyers or by means of popup 作者: 粉筆 時(shí)間: 2025-3-28 20:48 作者: MOCK 時(shí)間: 2025-3-29 01:35 作者: Fracture 時(shí)間: 2025-3-29 06:06 作者: Alpha-Cells 時(shí)間: 2025-3-29 07:24 作者: Glucocorticoids 時(shí)間: 2025-3-29 11:35
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Probn . sublinear time such that . has at most . points one either side of the hyper-plane, and at most . points within . distance to the hyper-plane, where .. is a constant for fixed .. In particular, .. = 1.209. To our best knowledge, this is the first sublinear time algorithm for finding geometric se作者: 投射 時(shí)間: 2025-3-29 15:55
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation wite polygonal curve using points of a square grid so that there exists a small number of different edge lengths and every edge length is between . and ., where . is a given parameter satisfying 1≤.≤2. Our first algorithm computes an approximate polygonal curve using fixed square grid points in .((./..作者: 河流 時(shí)間: 2025-3-29 21:54 作者: 精確 時(shí)間: 2025-3-30 02:05 作者: Explicate 時(shí)間: 2025-3-30 06:29 作者: Antioxidant 時(shí)間: 2025-3-30 09:48 作者: BUDGE 時(shí)間: 2025-3-30 13:49 作者: bisphosphonate 時(shí)間: 2025-3-30 18:36 作者: optic-nerve 時(shí)間: 2025-3-31 00:01 作者: Carbon-Monoxide 時(shí)間: 2025-3-31 03:49
y on our strongly held belief that no .-hard problem can be solved optimally in polynomial time. But obtaining . complexity lower bounds (even linear or near linear bounds) remains the central challenge of complexity theory. In the complementary fields of complexity theory and that of algorithm desi作者: 損壞 時(shí)間: 2025-3-31 05:06 作者: 媽媽不開(kāi)心 時(shí)間: 2025-3-31 10:47 作者: 駭人 時(shí)間: 2025-3-31 15:05
Densities of Aliphatic Hydrocarbons: Alkanesth some finite capacity is required to transports a specified amount of goods for requests from the sources to the destinations. Calls for rides come in while the server is travelling. Each request also specifies a deadline. If a request is not be served by its deadline, it will be called off. The s作者: 保全 時(shí)間: 2025-3-31 20:01 作者: overbearing 時(shí)間: 2025-3-31 23:22
