Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "linear complexity" wg kryterium: Temat


Wyświetlanie 1-9 z 9
Tytuł:
Improved linear complexities of the frequency hopping sequences in two optimal sets
Autorzy:
Gao, J.
Li, X.
Wei, Y.
Powiązania:
https://bibliotekanauki.pl/articles/206234.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
frequency hopping sequence
linear complexity
permutation polynominal
optimal set
Opis:
For the anti-jamming purpose, high linear complexity is desired for each frequency hopping sequence in an optimal set. Using a proper power permutation, Wang has shown that an optimal set of frequency hopping sequences with small linear complexity can be transformed into a new optimal set of frequency hopping sequences with large linear complexity. This paper conains two results. First, we extend the result of Wang. A power permutation is only suitable for a special construction of optimal set of frequency hopping sequences, see Wang (2011). However, the power permutation chosen in this paper applies to the general construction of optimal set of frequency hopping sequences. Second, by using a binomial permutation polynomial P(x), which is different from those permutations used before, we obtain a novel optimal set of frequency hopping sequences with high linear complexity from an optimal set of frequency hopping sequences with small linear complexity. By counting the number of different roots in the sequence representation, we determine the linear complexities of the frequency hopping sequences in two optimal sets transformed by the power permutation or binomial permutation.
Źródło:
Control and Cybernetics; 2012, 41, 2; 317-334
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Continued fractions of Laurent series with partial quotients from a given set
Autorzy:
Lauder, Alan
Powiązania:
https://bibliotekanauki.pl/articles/1390477.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
continued fractions
finite fields
Laurent series
linear complexity profiles
sequences
Źródło:
Acta Arithmetica; 1999, 90, 3; 251-271
0065-1036
Pojawia się w:
Acta Arithmetica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A locally polynomial method for solving a system of linear inequalities
Autorzy:
Evtushenko, Yuri
Szkatuła, Krzysztof
Tretyakov, Alexey
Powiązania:
https://bibliotekanauki.pl/articles/2183463.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linear programming
system of linear inequalities
computational complexity
locally-polynomial algorithm
convergence rate
Opis:
The paper proposes a method for solving systems of linear inequalities. This method determines in a finite number of iterations whether the given system of linear ineqalities has a solution. If it does, the solution for the given system of linear inequalities is provided. The computational complexity of the proposed method is locally polynomial.
Źródło:
Control and Cybernetics; 2021, 50, 2; 301--314
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The use of integral information in the solution of a two-point boundary value problem
Autorzy:
Drwięga, T.
Powiązania:
https://bibliotekanauki.pl/articles/255474.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
boundary value problem
complexity
worst case setting
linear information
Opis:
We study the worst-case ε-complexity of a two-point boundary value problem u″(x) = ƒ(x) u (x), x ∈ [0,T], u(0) = c, u′ (T) = 0, where c,T ∈ R (c ≠ 0, T > 0) and ƒ is a nonnegative function with r (r ≥ 0) continuous bounded derivatives. We prove an upper bound on the complexity for linear information showing that a speed-up by two orders of magnitude can be obtained compared to standard information. We define an algorithm based on integral information and analyze its error, which provides an upper bound on the ε-complexity.
Źródło:
Opuscula Mathematica; 2007, 27, 2; 205-220
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On transformation of STRIPS planning to linear programming
Autorzy:
Galuszka, A.
Powiązania:
https://bibliotekanauki.pl/articles/229963.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
planning
problem solving
block world
uncertainty
linear programming
computational complexity
Opis:
STRIPS language is a convenient representation for artificial intelligence planning problems. Planning is a task of coming up with a sequence of actions that will achieve a goal. In this work a heuristic of polynomial transformation of STRIPS planning problem to linear programming problem (LP) is presented. This is done because planning problems are hard computational problems (PSPACE- complete in general case) and LP problems are known to be computational easy. Representation of STRIPS planning as a set of equalities and inequalities based on the transformation is also proposed. The exemplary simulation shows the computational efficiency of solving planning problem with proposed transformation.
Źródło:
Archives of Control Sciences; 2011, 21, 3; 243-267
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Involutive Nonassociative Lambek Calculus: Sequent Systems and Complexity
Autorzy:
Buszkowski, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/749946.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
nonassociative Lambek calculus
linear logic
sequent system
cut elimination
PTIME complexity
Opis:
In [5] we study Nonassociative Lambek Calculus (NL) augmented with De Morgan negation, satisfying the double negation and contraposition laws. This logic, introduced by de Grooté and Lamarche [10], is called Classical Non-Associative Lambek Calculus (CNL). Here we study a weaker logic InNL, i.e. NL with two involutive negations. We present a one-sided sequent system for InNL, admitting cut elimination. We also prove that InNL is PTIME.
Źródło:
Bulletin of the Section of Logic; 2017, 46, 1/2
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Autorzy:
Płaczek, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/1023344.pdf
Data publikacji:
2020-11-13
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Substructural logic
Lambek calculus
nonassociative linear logic
sequent system
PTime complexity
Opis:
Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic. Here we prove an analogous result for the nonassociative version of this logic. Like Lambek, we consider a left-sided system, but the result also holds for its right-sided version, by a natural symmetry. The treatment of nonassociative sequent systems involves some subtleties, not appearing in associative logics. We also prove the PTime complexity of the multiplicative fragment of NBL.
Źródło:
Bulletin of the Section of Logic; 2021, 50, 1; 55-80
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Schur Parametrization and Modeling of p-Stationary Second-Order Time-Series for LPC Transmission
Autorzy:
Wielgus, A.
Zarzycki, J.
Powiązania:
https://bibliotekanauki.pl/articles/226070.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
second-order nonstationary time-series
linear Schur parametrization/modeling
complexity reduction
Opis:
Following the results presented in [21], we present an efficient approach to the Schur parametrization/modeling of a subclass of second-order time-series which we term p-stationary time-series, yielding a uniform hierarchy of algorithms suitable for efficient implementations and being a good starting point for nonlinear generalizations to higher-order non-Gaussian nearstationary time-series.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 3; 343-350
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On transformation of conditional, conformant and parallel planning to linear programming
Autorzy:
Galuszka, Adam
Probierz, Eryka
Powiązania:
https://bibliotekanauki.pl/articles/1409385.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
planning
conformant planning
conditional planning
parallel planning
uncertainty
linear programming
computational complexity
Opis:
Classical planning in Artificial Intelligence is a computationally expensive problem of finding a sequence of actions that transforms a given initial state of the problem to a desired goal situation. Lack of information about the initial state leads to conditional and conformant planning that is more difficult than classical one. A parallel plan is the plan in which some actions can be executed in parallel, usually leading to decrease of the plan execution time but increase of the difficulty of finding the plan. This paper is focused on three planning problems which are computationally difficult: conditional, conformant and parallel conformant. To avoid these difficulties a set of transformations to Linear Programming Problem (LPP), illustrated by examples, is proposed. The results show that solving LPP corresponding to the planning problem can be computationally easier than solving the planning problem by exploring the problem state space. The cost is that not always the LPP solution can be interpreted directly as a plan.
Źródło:
Archives of Control Sciences; 2021, 31, 2; 375-399
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-9 z 9

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies