Results 11 to 20 of about 2,482,039 (287)
Approaches for Efficiently Detecting Frontier Cells in Robotics Exploration
Frontiers in Robotics and AI, 2021 Many robot exploration algorithms that are used to explore office, home, or outdoor environments, rely on the concept of frontier cells. Frontier cells define the border between known and unknown space.
Phillip Quin +4 more
doaj +1 more source
Borel oracles. An analytical approach to constant-time algorithms [PDF]
, 2009 In 2008 Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs.
G. Elek, Gábor Lippner
semanticscholar +1 more source
Prediction of zero crossing point of fault current based on Bayesian estimation
Zhejiang dianli, 2022 Breaking capacity of circuit breakers can no longer meet the continuous rising demand of fault current in present new power systems. The phrase-controlled fault interruption technology based on zero crossing point prediction is an important solution ...
LIU Yunfei, ZHOU Qiwen, FANG Taixun
doaj +1 more source
A constant-time algorithm for middle levels Gray codes [PDF]
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017 For any integer $n\geq 1$ a middle levels Gray code is a cyclic listing of all $n$-element and $(n+1)$-element subsets of $\{1,2,\ldots,2n+1\}$ such that any two consecutive subsets differ in adding or removing a single element. The question whether such a Gray code exists for any $n\geq 1$ has been the subject of intensive research during the last 30 ...
Torsten Mütze, Jerri Nummenpalo
openaire +5 more sources
Constant-work-space algorithms for geometric problems
Journal of Computational Geometry, 2011 Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a read-only array.
Tetsuo Asano +3 more
doaj +3 more sources
Subexponential-Time Algorithms for Sparse PCA [PDF]
Foundations of Computational Mathematics, 2019 We study the computational cost of recovering a unit-norm sparse principal component $$x \in \mathbb {R}^n$$ x ∈ R n planted in a random matrix, in either the Wigner or Wishart spiked model (observing either $$W + \lambda xx^\top $$ W + λ x x ⊤ with W ...
Yunzi Ding +3 more
semanticscholar +1 more source
Incorporating Learnable Membrane Time Constant to Enhance Learning of Spiking Neural Networks [PDF]
IEEE International Conference on Computer Vision, 2020 Spiking Neural Networks (SNNs) have attracted enormous research interest due to temporal information processing capability, low power consumption, and high biological plausibility.
Wei Fang +5 more
semanticscholar +1 more source
Nuclear Engineering and Technology, 2022 Recent developments on spectral diffusion algorithms, i.e., algorithms which exploit the projection of the solution on the eigenfunctions of the Laplacian operator, demonstrated their effective applicability in fast transient conditions.
G. Zullo, D. Pizzocri, L. Luzzi
doaj +1 more source
IEEE Transactions on Control of Network Systems, 2020 In this article, we propose distributed continuous-time algorithms to solve the optimal resource allocation problem with certain time-varying quadratic cost functions for multiagent systems.
Bo Wang, Shan Sun, W. Ren
semanticscholar +1 more source
Constant Time Updates in Hierarchical Heavy Hitters [PDF]
Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2017 Monitoring tasks, such as anomaly and DDoS detection, require identifying frequent flow aggregates based on common IP prefixes. These are known as hierarchical heavy hitters (HHH), where the hierarchy is determined based on the type of prefixes of ...
R. Ben-Basat +4 more
semanticscholar +1 more source