標(biāo)題: Titlebook: Computing and Combinatorics; 28th International C Yong Zhang,Dongjing Miao,Rolf M?hring Conference proceedings 2022 The Editor(s) (if appli [打印本頁(yè)] 作者: inroad 時(shí)間: 2025-3-21 17:40
書目名稱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é)科排名
作者: 抵消 時(shí)間: 2025-3-21 23:27
Unidirectional Transmission of Light, hardness result. Finally, we show how to apply our framework to an assignment problem related to transportation systems with the corresponding models, numerical experiments based on real-world data, and improvements on previous work.作者: 群居男女 時(shí)間: 2025-3-22 01:04 作者: Halfhearted 時(shí)間: 2025-3-22 06:03 作者: 致命 時(shí)間: 2025-3-22 10:36
,Analysis of?Approximate Sorting in?I/O Model,lationship endowed by these two metrics, we find the lower bound of these two metrics of the permutation generated by any external approximate sorting algorithm with . I/O operations. Finally, we propose a k-pass external approximate sorting algorithm that is asymptotically optimal in I/O model.作者: Hla461 時(shí)間: 2025-3-22 14:31 作者: Hla461 時(shí)間: 2025-3-22 19:25 作者: 松雞 時(shí)間: 2025-3-22 22:34 作者: Corroborate 時(shí)間: 2025-3-23 01:38 作者: ACE-inhibitor 時(shí)間: 2025-3-23 07:30 作者: 翻布尋找 時(shí)間: 2025-3-23 12:32
https://doi.org/10.1007/1-4020-2354-5 time where .. The objective of the former problem is to minimize the completion time on ., while that of the latter problem is to minimize the completion time when all jobs are transported to the destination. For each problem we design a polynomial-time approximation scheme (PTAS).作者: Monotonous 時(shí)間: 2025-3-23 14:30
Tatsuko Hatakeyama,Hyoe Hatakeyama indexed from left to right) are linked in a “cascading” manner to their right neighbors. We use this new circuit model to characterize a nondeterministic variant of the aux-.-sda’s that run in polynomial time using logarithmic work space.作者: anatomical 時(shí)間: 2025-3-23 22:05 作者: RAG 時(shí)間: 2025-3-23 22:28 作者: Crumple 時(shí)間: 2025-3-24 04:25 作者: alcohol-abuse 時(shí)間: 2025-3-24 08:46
,Turing Machines with?Two-Level Memory: A Deep Look into?the?Input/Output Complexity,mplexity and the other complexity measures such as time complexity and parameterized complexity, which is not considered by former researchers. We also define the external access trace complexity, which reflects the physical behavior of magnetic disks and gives a theoretical evidence of IO-efficient algorithms.作者: 羞辱 時(shí)間: 2025-3-24 12:34 作者: Palpate 時(shí)間: 2025-3-24 16:08 作者: CARE 時(shí)間: 2025-3-24 19:12
Online One-Sided Smooth Function Maximization,hat it achieves a . approximation with the regret of . (where . is the horizon of the online optimization problem) over any convex set. Note that the approximation result is same as the offline version of the . maximization problem.作者: incontinence 時(shí)間: 2025-3-25 00:23
,Large ,-Gons in?a?1.5D Terrain,s with at most . vertices, within a factor .. For the case where ., we discuss an .(.) time exact algorithm for computing the longest line segment in ., and for ., we design an . time exact algorithm for computing the largest-perimeter triangle that lies within ..作者: hauteur 時(shí)間: 2025-3-25 04:35 作者: CRAFT 時(shí)間: 2025-3-25 09:49 作者: 骨 時(shí)間: 2025-3-25 15:19
https://doi.org/10.1007/978-1-4939-2581-0e, while requiring a “small” amortized cost, i.e. a “small” number of operations per insertion or deletion, on average. In our work, we provide the first constant bi-criteria approximation algorithm for such a problem with its amortized cost being independent of both . and the size of the current input.作者: 四溢 時(shí)間: 2025-3-25 19:03 作者: voluble 時(shí)間: 2025-3-25 23:00 作者: MAPLE 時(shí)間: 2025-3-26 02:26
https://doi.org/10.1007/978-3-031-22105-7adaptive algorithms; approximation algorithms; approximation scheme; approximation theory; combinatorial作者: foppish 時(shí)間: 2025-3-26 08:02
978-3-031-22104-0The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Occupation 時(shí)間: 2025-3-26 10:16
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234763.jpg作者: 漸強(qiáng) 時(shí)間: 2025-3-26 14:32 作者: Apogee 時(shí)間: 2025-3-26 20:04
Computing and Combinatorics978-3-031-22105-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Unsaturated-Fat 時(shí)間: 2025-3-27 00:45
0302-9743 Overview: Chapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.978-3-031-22104-0978-3-031-22105-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使人入神 時(shí)間: 2025-3-27 02:34 作者: 孵卵器 時(shí)間: 2025-3-27 08:38 作者: Lipoprotein(A) 時(shí)間: 2025-3-27 12:15 作者: entrance 時(shí)間: 2025-3-27 14:12
Tatsuko Hatakeyama,Hyoe Hatakeyamatuitive concept of “l(fā)ottery tickets”, to decide which elements to sample. We prove that . is inside the .-deficient framework for the Heavy Hitters problem and that it has a similar performance to the well known . algorithm, although they are very different in nature. More importantly, we define a s作者: aquatic 時(shí)間: 2025-3-27 17:59 作者: mediocrity 時(shí)間: 2025-3-28 00:24
Tatsuko Hatakeyama,Hyoe Hatakeyamaex object of exactly or at most . vertices inside .. For a constant ., we design a near linear time FPTAS that approximates the largest convex polygons with at most . vertices, within a factor .. For the case where ., we discuss an .(.) time exact algorithm for computing the longest line segment in 作者: wangle 時(shí)間: 2025-3-28 04:08
Tatsuko Hatakeyama,Hyoe Hatakeyama [COCOON 2021, LNCS, vol. 13025, pp. 164–175]. It was shown that all languages recognized by polynomial-time logarithmic-space aux-.-sda’s are located between . and . (the .th level of Steve’s class). We further propose a new and simple computational model of semi-unbounded fan-in Boolean circuits c作者: 結(jié)合 時(shí)間: 2025-3-28 09:59
Tatsuko Hatakeyama,Hyoe Hatakeyamae as possible to the true ordering of elements in . I/O operations. However, the quality of approximate sorting in I/O model can not be well measured by the existing metrics on permutation space. Thus, we propose a new kind of metric named External metric, which ignores the errors and dislocation th作者: 事與愿違 時(shí)間: 2025-3-28 10:31 作者: Cirrhosis 時(shí)間: 2025-3-28 15:40
Unidirectional Transmission of Light,nd an .-dimensional capacity vector for some positive integer .. Item . has an .-dimensional binary weight vector . with consecutive 1s. Assigning item . to bin . yields an amount of reward . and a cost .. The objective is to maximize the total rewards by designing an assignment such that (i) no bin作者: 壓迫 時(shí)間: 2025-3-28 21:39 作者: 膠狀 時(shí)間: 2025-3-29 00:26 作者: 寡頭政治 時(shí)間: 2025-3-29 04:37 作者: glamor 時(shí)間: 2025-3-29 10:33
Conclusions and Recommendations,h agent is located on a line and has an ordinal preference over the facilities. Our goal is to design strategyproof mechanisms that elicit truthful information (preferences and/or locations) from the agents and locate the facilities to minimize both maximum and total cost objectives as well as to ma作者: Expand 時(shí)間: 2025-3-29 13:30 作者: 細(xì)查 時(shí)間: 2025-3-29 18:52 作者: Carminative 時(shí)間: 2025-3-29 22:04 作者: 半導(dǎo)體 時(shí)間: 2025-3-30 01:14
Lecture Notes in Earth Sciences a lot of former researchers. However, the existing works failed to consider the input/output complexity in a computation model point of view. In this paper we remedy this by proposing three variants of Turing machine that include external memory and the mechanism of exchanging data between main mem作者: BLUSH 時(shí)間: 2025-3-30 06:40
https://doi.org/10.1007/BFb0021871 availability of nontrivial factors in the universe of search of Pollard’s Rho. The running time of Pollard’s Rho is reduced to polynomial-time on a quantum model of computation so long as we use a certain set of functions for generating the sequence of numbers that compose the method’s universe of 作者: BRAVE 時(shí)間: 2025-3-30 10:48 作者: surmount 時(shí)間: 2025-3-30 12:30
,Refutation of?Spectral Graph Theory Conjectures with?Monte Carlo Search,We demonstrate how Monte Carlo Search (MCS) algorithms, namely Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA), can be used to build graphs and find counter-examples to spectral graph theory conjectures in minutes.作者: indignant 時(shí)間: 2025-3-30 18:01 作者: Banister 時(shí)間: 2025-3-30 20:57
,Approximation Algorithms for?the?Min-Max Mixed Rural Postmen Cover Problem and?Its Variants,ndition, i.e. for every arc there is a parallel edge of no greater weight, we propose an algorithm for the MRPCP, whose approximation ratio lies between . and . depending on the ratio of the weight of . to that of .. When . and ., it is a .-approximation algorithm for the Min-Max Stacker Crane Cover作者: dainty 時(shí)間: 2025-3-31 03:12 作者: microscopic 時(shí)間: 2025-3-31 06:44
,Revisiting Maximum Satisfiability and?Related Problems in?Data Streams,ng .-SAT problem that asks to decide whether one can satisfy all size-. input clauses must use . space..We also consider the related minimum satisfiability problem (.), introduced by Kohli et al. (SIAM J. Discrete Math. 1994), that asks to find an assignment that minimizes the number of satisfied cl作者: parsimony 時(shí)間: 2025-3-31 10:31 作者: 全能 時(shí)間: 2025-3-31 13:57 作者: 友好關(guān)系 時(shí)間: 2025-3-31 19:16 作者: 莊嚴(yán) 時(shí)間: 2025-3-31 23:35 作者: rheumatism 時(shí)間: 2025-4-1 04:18
Lecture Notes in Earth Sciencesng .-SAT problem that asks to decide whether one can satisfy all size-. input clauses must use . space..We also consider the related minimum satisfiability problem (.), introduced by Kohli et al. (SIAM J. Discrete Math. 1994), that asks to find an assignment that minimizes the number of satisfied cl作者: senile-dementia 時(shí)間: 2025-4-1 08:17
https://doi.org/10.1007/BFb0021871ound are dependent on the order of an element in the multiplicative group of integers modulo a composite, whose fast computation can currently only be done by Shor’s algorithm. However, the quantum version of Pollard’s Rho is still useful even with this limitation: when Shor’s algorithm fails to fac作者: 表主動(dòng) 時(shí)間: 2025-4-1 10:40
,A Stochastic Non-monotone DR-Submodular Maximization Problem over?a?Convex Set, arises as an expectation of a set of stochastic functions. We develop an algorithm named SPIDER-FW, which is a stochastic version of the classical Frank-Wolfe algorithm with . (in expectation) approximation guarantee, the best guarantee so far for the above setting, achieved with . iterations, and 作者: 背帶 時(shí)間: 2025-4-1 15:18 作者: cancer 時(shí)間: 2025-4-1 19:53
