نتایج جستجو برای: consistent algorithm

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

2004
Simon Saunders

Special relativity is most naturally formulated as a theory of spacetime geometry, but within the spacetime framework probability appears to be a purely epistemic notion. It is possible that progress can be made with rather di¤erent approaches covariant stochastic equations, in particular but the results to date are not encouraging. However, it seems a non-epistemic notion of probability can be...

Journal: :int. journal of mining & geo-engineering 2014
abolfazl asadian ali moradzadeh alireza arab-amiri ali nejati kalateh davood rajabi

the helicopter-borne electromagnetic (hem) frequency-domain exploration method is an airborne electromagnetic (aem) technique that is widely used for vast and rough areas for resistivity imaging. the vast amount of digitized data flowing from the hem method requires an efficient and accurate inversion algorithm. generally, the inverse modelling of hem data in the first step requires a precise a...

Journal: :IEEE Transactions on Signal Processing 2021

Phase retrieval (PR) is an important component in modern computational imaging systems. Many algorithms have been developed over the past half-century. Recent advances deep learning introduced new possibilities for a robust and fast PR. An emerging technique called unfolding provides systematic connection between conventional model-based iterative data-based learning. Unfolded algorithms, which...

2007
Gábor Lugosi Shie Mannor Gilles Stoltz

We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sense that they achieve, asymptotically, the best possible average reward. It was Rustichini [11] who first proved the existence of such consistent predi...

Journal: :International Journal of Data Mining & Knowledge Management Process 2012

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...

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

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