Results 41 to 50 of about 3,866,035 (337)
A Hardware-Oriented and Memory-Efficient Method for CTC Decoding
The Connectionist Temporal Classification (CTC) has achieved great success in sequence to sequence analysis tasks such as automatic speech recognition (ASR) and scene text recognition (STR).
Siyuan Lu +3 more
doaj +1 more source
Rectangle Search: An Anytime Beam Search (Extended Version)
Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known anytime search algorithms are based on best-first search.
Lemons, Sofia +3 more
openaire +2 more sources
Anomaly Detection in Smart Homes Using Deep Learning [PDF]
Smart homes enable many people, especially the elderly and patients, to live alone and maintain their independence and comfort. The realization of this goal depends on monitoring all activities in the house to report any observed anomaly immediately to ...
M. Moallem, H. Hassanpour, A. A. Pouyan
doaj +1 more source
Pruning State Spaces with Extended Beam Search [PDF]
State space explosion is a major problem in both qualitative and quantitative model checking. This article focuses on using beam search, a heuristic search algorithm, for pruning weighted state spaces while generating. The original beam search is adapted to the state space generation setting and two new variants, motivated by practical case studies ...
Wijs, A.J., Torabi Dashti, Muhammad
openaire +3 more sources
Beam Monte-Carlo Tree Search [PDF]
Monte-Carlo Tree Search (MCTS) is a state-of-the-art stochastic search algorithm that has successfully been applied to various multi- and one-player games (puzzles). Beam search is a search method that only expands a limited number of promising nodes per tree level, thus restricting the space complexity of the underlying search algorithm to linear in ...
Baier, Hendrik, Winands, Mark H. M.
openaire +2 more sources
Monte Carlo tree search is the state of the art for multiple games and for solving puzzles such as Morpion Solitaire. Nested Monte Carlo (NMC) search is a Monte Carlo tree search algorithm that works well for solving puzzles. We propose to enhance NMC search with beam search. We test the algorithm on Morpion Solitaire.
openaire +1 more source
Hybridizing Beam Search with Tabu Search for the Irregular Packing Problem
The irregular packing problem involves arranging all the irregular pieces on a plate with the objective of maximizing the use of material. In this article, the layout is formed by the ordered sequence of the irregular pieces which is obtained by a hybrid
Yunqing Rao, Peng Wang, Qiang Luo
semanticscholar +1 more source
Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search [PDF]
We present Grid Beam Search (GBS), an algorithm which extends beam search to allow the inclusion of pre-specified lexical constraints. The algorithm can be used with any model which generates sequences token by token. Lexical constraints take the form of
Chris Hokamp, Qun Liu
semanticscholar +1 more source
To enable multi-stream transmission and increase the achievable rate, a hybrid digital/analog precoding structure is usually adopted in millimeter-wave (mmWave) MIMO systems.
Zhenyu Xiao, Pengfei Xia, Xiang-Gen Xia
doaj +1 more source
A Multimodal Adversarial Attack Framework Based on Local and Random Search Algorithms
Although many problems in computer vision and natural language processing have made breakthrough progress with neural networks, adversarial attack is a serious potential problem in many neural network- based applications.
Zibo Yi, Jie Yu, Yusong Tan, Qingbo Wu
doaj +1 more source

