PYRAFORMER: LOW-COMPLEXITY PYRAMIDAL ATTENTION FOR LONG-RANGE TIME SERIES MODELING AND FORECASTING ICLR 2022 Code link Electricity, Wind, ETT data and App Flow a novel model based on pyramidal attention that can effectively describe both short and long temporal dependencies with low time and space ...
facility location/ C1290 Applications of systems theory C1180 Optimisation techniques C4240C Computational complexitySummary: A polynomial time algorithm to obtain an exact solution for the equiweighted minimax location problem when the demand points are spread over a hemisphere is presented. It is ...
展开 关键词: computational complexity minimax techniques telecommunication network routing wireless sensor networks computational complexity energy constraint flow routing schedule lexicographic max-min node lifetime node lifetime vector polynomial-time algorithm DOI...
Liu, “Adaptive finite-time congestion control for uncertain TCP/AQM network with unknown hysteresis,” Complexity, vol. 2020, Article ID 4138390, July 2020. Z. H. Li, Y. Liu, and Y. W. Jing, “Active queue management algorithm for TCP networks with integral backstepping and minimax,” ...
MINIMAXGAMES,SPINGLASSESANDTHE POLYNOMIAL-TIMEHIERARCHYOFCOMPLEXITYCLASSES VARGAPETER Abstract.Weusethenegativereplicamethod,whichwasoriginallydevel- opedforthestudyofoverfrustationindisorderedsystem,toinvestigatethe statisticalbehaviourofthecostfunctionofminimaxgames.Thesegames aretreatedashierarchicalstatisticalmechanical...
The general use of GTS algorithm is in real time applications having much higher complexity like video games, chess, connect6, Go etc. Dif... DV Patil,KN Shedge 被引量: 0发表: 0年 加载更多研究点推荐 hybrid system control Real-Time Game-Tree Search hybrid system control game real-time ...
Examples of Time Complexity Jyh-Shing Roger Jang (張智星) CSIE Dept, National Taiwan University Time Complexity Examples: O(n) for (i=0; i<n; i++) { statements… } for (i=0; i<n; i=i+2) { statements… } for (i=0; i<n; i=i+50) { statements… } Time Complexity Examples...
Under a standard assumption in complexity theory (NP not in P/poly), we demonstrate a gap between the minimax prediction risk for sparse linear regression ... Y Zhang,MJ Wainwright,MI Jordan - 《Journal of Machine Learning Research》 被引量: 81发表: 2014年 A simple decomposition algorithm fo...
of Service(QoS) on the user side. Any part of the workload change, resource availability change or network latency could incur dynamics in an offloading environment. In this work, we propose a robust PAC (probably approximately correct) offloading algorithm to address this dynamic issue together ...
Minimax can be extended to the maxn algorithm for more than two players, which admits a much weaker form of alpha-beta pruning. Finally, we explore real-time search algorithms for single-agent problems. Minimax is specialized to minimin , which allows a very powerful alpha pruning algorithm....