Results 31 to 40 of about 179,741 (181)
Implementasi Algoritma Greedy pada Pencarian Langkah Optimal Permainan Mahjong Solitaire
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2017 The game of mahjong solitaire is a difficult tough teaser and takes a long time to complete when manually played by the user. The greedy algorithm is applied to find the optimal step in completion of this solitaire mahjong game.
Alvin Juvianto, Halim Agung
doaj +1 more source
Optimal Power Allocation With Multiple Joint Associations in Multi-User MIMO Full-Duplex Systems
IEEE Access, 2023 Optimum power allocation is an effective way to mitigate residual self-interference and inter-user interference in multiple input multiple output full-duplex (FD) systems.
Kunbei Pan, Bin Zhou, Zhiyong Bu
doaj +1 more source
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
Bit-filling algorithm for fast subcarrier-selecting in ultrasonic through-metal communication
Tongxin xuebao, 2020 Aiming at the high complexity of the greedy bit-filling algorithm,a bit-filling algorithm for fast subcarrier-selecting used in ultrasonic through-metal communication was proposed.The approximate expression for the BER increment,which was used as the ...
Linsen XU +3 more
doaj +2 more sources
Applied Sciences, 2018 The goal of phase retrieval is to recover an unknown signal from the random measurements consisting of the magnitude of its Fourier transform. Due to the loss of the phase information, phase retrieval is considered as an ill-posed problem.
Zhuolei Xiao +4 more
doaj +1 more source
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
SHS Web of Conferences, 2022 Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i.
Deshpande, Amol +2 more
core +1 more source
Fast greedy triangulation algorithms [PDF]
Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dickerson, Matthew T. +3 more
openaire +2 more sources
Revista de Matemática: Teoría y Aplicaciones, 2009 When cash becomes available in a company, there are several strategies that allow us to benefit from it. The problem is how much to invest, for how long, and using which of the investment options in order to get the maximum profit out of it.
Juan Flores +3 more
doaj +1 more source
A new efficient RLF-like algorithm for the vertex coloring problem [PDF]
Yugoslav Journal of Operations Research, 2016 The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices.
Adegbindin Mourchid +2 more
doaj +1 more source