نتایج جستجو برای: like algorithms

تعداد نتایج: 957857  

Journal: :bulletin of the iranian mathematical society 2014
effat golpar-raboky n. mahdavi-amiri

classes of‎ ‎abaffy-broyden-spedicato (abs) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎the algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎here‎, ‎we show how to apply the abs algorithms to devise algorithms to compute the wz and zw‎ ‎factorizations of a nonsingular matrix as well as...

Journal: :bulletin of the iranian mathematical society 2011
b. farzad m. mahdian e. s. mahmoodian a. saberi b. sadri

2002
Spyros Angelopoulos Allan Borodin

We apply and extend the priority algorithm framework introduced by Borodin, Nielsen and Rackoo to deene \greedy-like" algorithms for (uncapacitated) facility location problems and set cover. These problems have been the focus of extensive research from the point of view of approximation algorithms, and for both problems, greedy algorithms have been proposed and analyzed. The priority algorithm ...

2007
Christophe Gonzales Khaled Mellouli Olfa Mourali

Message-passing inference algorithms for Bayes nets can be broadly divided into two classes: i) clustering algorithms, like Lazy Propagation, Jensen’s or Shafer-Shenoy’s schemes, that work on secondary undirected trees; and ii) conditioning methods, like Pearl’s, that use directly Bayes nets. It is commonly thought that algorithms of the former class always outperform those of the latter becaus...

2005
Geoffrey J. Gordon

No-regret algorithms are a popular class of learning rules which map a sequence of input vectors x1, x2 . . . to a sequence of predictions y1, y2, . . .. Unfortunately, most no-regret algorithms assume that the predictions yt are chosen from a small, discrete set. We consider instead prediction problems where yt has internal structure: yt might be a strategy in a game like poker, or a configura...

2009
Mauro Birattari Zhi Yuan Prasanna Balaprakash Thomas Stützle

Many state-of-the-art algorithms for tackling computationally hard problems have a number of parameters that influence their search behavior. Such algorithms include exact algorithms like branch-and-bound algorithms, algorithm packages like CPLEX for integer programming, and also approximate algorithms such as virtually all metaheuristics. Examples of parameters are numerical parameters such as...

Journal: :Signal Processing 2021

The concept of threshold array signal-to-noise ratio (ASNR) which is defined as the minimal SNR at specific high-resolution algorithms are able to resolve two closely spaced far-field sources, allows quantify and compare sensors performance in localizing remote targets. This paper generalizes extends expressions ASNR given literature for conventional non-circular (NC) MUSIC direction-of-arrival...

I. E. P. Afrakoti, M. Shavandi

Despite recent advances in face recognition systems, they suffer from serious problems because of the extensive types of changes in human face (changes like light, glasses, head tilt, different emotional modes). Each one of these factors can significantly reduce the face recognition accuracy. Several methods have been proposed by researchers to overcome these problems. Nonetheless, in recent ye...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید