標題: Titlebook: Computing and Combinatorics; 19th International C Ding-Zhu Du,Guochuan Zhang Conference proceedings 2013 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: Washington 時間: 2025-3-21 16:39
書目名稱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é)科排名
作者: 斗爭 時間: 2025-3-22 00:09
https://doi.org/10.1007/978-3-642-66040-5 computed efficiently and interleaving is not needed to achieve optimality. However, in both types of networks, how to find the optimal sequence of execution remains a big challenge for jobs with general workloads.作者: 正式演說 時間: 2025-3-22 02:11 作者: nascent 時間: 2025-3-22 06:14
Optimal Stopping Meets Combinatorial Optimizationorithm to select multiple elements from the sequence, subject to a combinatorial feasibility constraint on the set selected. A sequence of results during the past ten years have contributed greatly to our understanding of these problems. I will survey some of these developments and their applications to topics in algorithmic game theory.作者: 樹木心 時間: 2025-3-22 12:14 作者: Coronary-Spasm 時間: 2025-3-22 14:11
Selection from Read-Only Memory with Limited Workspaceeneralize our algorithm for the case when the size of the workspace is .(.) bits, .. The running time of our generalized algorithm is ., slightly improving over the bound . of Frederickson’s algorithm. Of independent interest, the wavelet stack—a structure we used for repeated pruning—may also be useful in other applications.作者: Coronary-Spasm 時間: 2025-3-22 19:06
Random Methods for Parameterized ProblemsPacking problem, we study the kernel and randomized algorithm for the degree-bounded instance, and then by using the iterative compression technique, a randomized algorithm of running time ..(3.) is given for the Parameterized Co-Path Packing problem, improving the current best result ..(3.24.).作者: 偶然 時間: 2025-3-23 00:03 作者: expeditious 時間: 2025-3-23 01:30 作者: Promotion 時間: 2025-3-23 07:29
https://doi.org/10.1007/BFb0008699rithm provides an experimental evidence that the correct upper bound is smaller than 2, thus disproving a currently believed conjecture, and can be used to test the validity of a new conjecture we propose, according to which the upper bound would decrease to ../6?+?1/4?≈?1.8949.作者: effrontery 時間: 2025-3-23 10:13 作者: Femish 時間: 2025-3-23 14:19
Calculation of thermospheric winds,se station moving along a fixed track in a wireless sensor network to minimize the latency of data collection. The main contribution is an .(. log.) expected time algorithm, where . is the number of sensors in the networks and . is the complexity of the fixed track.作者: 職業(yè) 時間: 2025-3-23 21:35
Presenting and Defending your Work Orallyctions of NBA, the new one is intuitive and easily implementable since it is completely based on subset construction. In addition, we have proved that both nondeterministic and deterministic partitioned automata share the same expressive power with NBA.作者: VOC 時間: 2025-3-24 00:19
Developing your Project Proposal they serve. We show that for any given placement of a facility by ., an optimal placement for . can be computed in .(.?+?.(log.?+?log.)) time. We also provide a polynomial-time algorithm for computing an optimal placement for ..作者: Outspoken 時間: 2025-3-24 02:27
Conference proceedings 2013na, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were 作者: 潰爛 時間: 2025-3-24 09:42
Recent Results for Online Makespan Minimization of . are known in advance. In the online variant the jobs arrive one by one. Each incoming job .. has to be assigned immediately to one of the machines without knowledge of any future jobs .., .′?>?..作者: STALE 時間: 2025-3-24 13:15 作者: GRATE 時間: 2025-3-24 16:16
On the Sequential Price of Anarchy of Isolation Games worst-case ratio between the social performance of an optimal solution and that of a Subgame Perfect Equilibrium, under the two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players’ utilities.作者: MIR 時間: 2025-3-24 22:37 作者: Fortify 時間: 2025-3-24 23:41
Deternimization of Büchi Automata as Partitioned Automatactions of NBA, the new one is intuitive and easily implementable since it is completely based on subset construction. In addition, we have proved that both nondeterministic and deterministic partitioned automata share the same expressive power with NBA.作者: 遭受 時間: 2025-3-25 06:34
The Discrete Voronoi Game in a Simple Polygon they serve. We show that for any given placement of a facility by ., an optimal placement for . can be computed in .(.?+?.(log.?+?log.)) time. We also provide a polynomial-time algorithm for computing an optimal placement for ..作者: Ossification 時間: 2025-3-25 10:52 作者: Guaff豪情痛飲 時間: 2025-3-25 13:24
Developing your Project Proposales. Two of these algorithms give regret-proof schedules, i.e. they reach Nash equilibria where no consumers regret their previous decisions. Our work is the first attempt to address these marketing problems from an algorithmic point of view.作者: gustation 時間: 2025-3-25 19:20
Developing your Project Proposalerably reduced. As a practical test we perform an experimental study of the length of the shortest reset word for random automata with .?≤?300 states and 2 input letters. In particular, we obtain a new estimation of the expected length of the shortest reset word ..作者: violate 時間: 2025-3-25 22:02
Online Algorithms for Batch Machines Scheduling with Delivery Times For the restrict case, we provide a best possible online algorithm with competitive ratio 1?+?.., where ..?>?0 is determined by .. Then we present an online algorithm with a competitive ratio of . for the general case.作者: 我就不公正 時間: 2025-3-26 02:24 作者: 因無茶而冷淡 時間: 2025-3-26 06:40
A Fast Algorithm Finding the Shortest Reset Wordserably reduced. As a practical test we perform an experimental study of the length of the shortest reset word for random automata with .?≤?300 states and 2 input letters. In particular, we obtain a new estimation of the expected length of the shortest reset word ..作者: miracle 時間: 2025-3-26 10:36
0302-9743 national Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a作者: single 時間: 2025-3-26 14:03 作者: 盡責 時間: 2025-3-26 19:21 作者: GRAVE 時間: 2025-3-26 22:47
Conference proceedings 2013na, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.作者: Confound 時間: 2025-3-27 02:51
Ding-Zhu Du,Guochuan ZhangUp-to-date results.Fast track conference proceedings.State-of-the-art report作者: Immobilize 時間: 2025-3-27 07:53 作者: Deceit 時間: 2025-3-27 10:15 作者: GOUGE 時間: 2025-3-27 15:39
978-3-642-38767-8Springer-Verlag Berlin Heidelberg 2013作者: MENT 時間: 2025-3-27 20:12 作者: amphibian 時間: 2025-3-28 01:19
https://doi.org/10.1007/BFb0008699e famous secretary problem asks to identify a stopping rule that maximizes the probability of selecting the maximum element in a sequence presented in uniformly random order. In a similar vein, the prophet inequality of Krengel, Sucheston, and Garling establishes the existence of an online algorithm作者: accessory 時間: 2025-3-28 03:51
https://doi.org/10.1007/BFb0008699with anonymous bidders with respect to the best fixed-price scheme. Previous works show that the optimal solution for this problem is in the range [1.6595,2]. We give a new lower bound of 1.68 and design an .(..) algorithm for computing upper bounds as a function of the number of bidders .. Our algo作者: Commission 時間: 2025-3-28 10:07 作者: syncope 時間: 2025-3-28 12:48 作者: Facilities 時間: 2025-3-28 16:22
https://doi.org/10.1007/BFb0008699alue of a coalition of players is defined to be the maximum total size of items in the coalition that can be packed into the bins of the coalition. We adopt the taxation model proposed by Faigle and Kern (1993) [6] and show that the 1/4-core is nonempty for all instances of the bin packing game. Thi作者: Carcinogen 時間: 2025-3-28 22:24 作者: fatuity 時間: 2025-3-29 02:35
Calculation of thermospheric winds,problem of computing an .-approximate saddle point, that is, a pair (..,..)?∈?.×. such that . Grigoriadis and Khachiyan (1995), based on a randomized variant of fictitious play, gave a simple algorithm for computing an .-approximate saddle point for matrix games, that is, when . is bilinear and the 作者: 雄辯 時間: 2025-3-29 03:11 作者: Gossamer 時間: 2025-3-29 07:37
Calculation of thermospheric winds,, a randomized parameterized algorithm of running time ..(6.75.) is obtained, improving the current best result ..(8.). For the Parameterized Co-Path Packing problem, we study the kernel and randomized algorithm for the degree-bounded instance, and then by using the iterative compression technique, 作者: 半圓鑿 時間: 2025-3-29 12:40 作者: Conclave 時間: 2025-3-29 18:54
Developing your Project Proposalf jobs are unknown until their arrival times. Once the processing of a job is completed it is delivered to the destination. The objective is to minimize the time by which all jobs have been delivered. For each job .., its processing time and delivery time are denoted by .. and .. , respectively. We 作者: 壁畫 時間: 2025-3-29 20:00 作者: depreciate 時間: 2025-3-30 01:45
Presenting and Defending your Work Orallyalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed . then the energy consumption is .. units of energy per time unit, where .?>?1. Our goal is to find a schedule respecting the release dates and the deadlines of the jobs so that the total energy c作者: 切割 時間: 2025-3-30 04:23
Developing your Project Proposal-access machine: The input is given in a read-only array and the capacity of workspace is limited. We prove that the linear-time prune-and-search algorithm—presented in most textbooks on algorithms—can be adjusted to use .(.) bits instead of Θ(.) words of extra space. Prior to our work, the best kno作者: grotto 時間: 2025-3-30 09:08
Presenting and Defending your Work Orallyoned Automata (DPA). Different from the existing automata, at most three different transitions may occur between two states of a DPA. This leads to a determinization construction of NBA with smaller state complexity but larger transition complexity. Compared with the existing determinization constru作者: 蝕刻 時間: 2025-3-30 14:18
Developing your Project Proposall security (in the seed length), and a large stretch (linear or polynomial in the seed length). We refer to such a pseudorandom generator as an .. We present a simple construction of an asymptotically optimal PRG from any one-way function .:{0,1}.?→?{0,1}. which satisfies the following requirements:作者: 我不死扛 時間: 2025-3-30 16:48 作者: 使堅硬 時間: 2025-3-30 23:33
Developing your Project Proposalplayers . and .. In this game, . places a point facility inside ., after which . places another point facility inside .. We say that a user . is served by its nearest facility, where distances are measured by the geodesic distance in .. The objective of each player is to maximize the number of users作者: syncope 時間: 2025-3-31 04:19
Computing and Combinatorics978-3-642-38768-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ENACT 時間: 2025-3-31 08:52 作者: GRACE 時間: 2025-3-31 09:23 作者: expository 時間: 2025-3-31 15:24 作者: 發(fā)展 時間: 2025-3-31 21:12
New Bounds for the Balloon Popping Problemwith anonymous bidders with respect to the best fixed-price scheme. Previous works show that the optimal solution for this problem is in the range [1.6595,2]. We give a new lower bound of 1.68 and design an .(..) algorithm for computing upper bounds as a function of the number of bidders .. Our algo作者: exigent 時間: 2025-3-31 22:17 作者: Excitotoxin 時間: 2025-4-1 02:30 作者: Callus 時間: 2025-4-1 09:18
The 1/4-Core of the Uniform Bin Packing Game Is Nonemptyalue of a coalition of players is defined to be the maximum total size of items in the coalition that can be packed into the bins of the coalition. We adopt the taxation model proposed by Faigle and Kern (1993) [6] and show that the 1/4-core is nonempty for all instances of the bin packing game. Thi作者: 抓住他投降 時間: 2025-4-1 10:42 作者: 外向者 時間: 2025-4-1 14:36
