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

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

2005
Dorian Suc Ivan Bratko

Usual numerical learning methods are primarily concerned with finding a good numerical fit to data and often make predictions that do not correspond to qualitative laws in the domain of modelling or expert intuition. In contrast, the idea of Q learning is to induce qualitative constraints from training data, and use the constraints to guide numerical regression. The resulting numerical predicti...

2007
Donghwan Lee Kyungkyu Kim Wonjun Lee

Emerging applications of RFID require high e–ciency of tag identiflcation. Since passive tags have dumb functionality, the efflciency of tag identiflcation in RFID system relies on the performance of the collision arbitration algorithm embedded in a reader. In this paper, we develop a novel collision arbitration algorithm, which is named Q-Algorithm, improving Q-Algorithm which is introduced in...

2008
SAUGATA BASU DMITRII V. PASECHNIK

Let R be a real closed field, Q ⊂ R[Y1, . . . , Y`, X1, . . . , Xk], with degY (Q) ≤ 2, degX(Q) ≤ d,Q ∈ Q,#(Q) = m, and P ⊂ R[X1, . . . , Xk] with degX(P ) ≤ d, P ∈ P,#(P) = s. Let S ⊂ R`+k be a semi-algebraic set defined by a Boolean formula without negations, with atoms P = 0, P ≥ 0, P ≤ 0, P ∈ P ∪ Q. We describe an algorithm for computing the the Betti numbers of S generalizing a similar alg...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 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...

2001
Alexandre V. Borovik A. V. Borovik

We propose a simple one sided Monte-Carlo algorithm to dis-tinguish, to any given degree of certainty, the symplectic group Cn(q) =PSp2n(q) from the orthogonal group Bn(q) = Ω2n+1(q) where q > 3 is oddand n and q are given. The algorithm does not use an order oracle and worksin polynomial, of n log q, time. This paper corrects an error in the previously published version of the<...

2002
Guozhen Xiao Shimin Wei

We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...

Journal: :J. Symb. Comput. 2012
Torsten Sprenger Wolfram Koepf

In [Koepf (1992)] it was shown how for a given holonomic function a representation as a formal power series of hypergeometric type can be determined algorithmically. This algorithm – that we call FPS algorithm (Formal Power Series) – combines three steps to obtain the desired representation. The authors implemented this algorithm in the computer algebra system Maple as c̀onvert/FormalPowerSeries...

Journal: :Proceedings of the Edinburgh Mathematical Society 2008

Journal: :Journal of information and communication convergence engineering 2010

Journal: :Intelligent Automation and Soft Computing 2023

The major environmental hazard in this pandemic is the unhygienic disposal of medical waste. Medical wastage not properly managed it will become a to environment and humans. Managing issue city, municipalities aspects environment, logistics. An efficient supply chain with edge computing technology used managing operations include processing waste collection, transportation, Many research works ...

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

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