PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  time complexity
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Analiza wybranych metod optymalizacyjnych w transporcie drogowym
Woźniak W., Stryjski R., Mielniczuk J., Wojnarowski T.
Prace Naukowe Politechniki Warszawskiej. Transport
|
2018
|
z. 120
447--458
PL
W artykule przedstawiono praktyczne rozwiązania problemu przydziału zleceń transportowych do dostępnych środków transportowych w transporcie drogowym. W tym celu dokonano analizy porównawczej wybranej metody optymalizacyjnej stosowanej w branży TSL z rozwiązaniem własnym. Zaproponowany algorytm do efektywnego przydziału wybranych zleceń transportowych opracowano na podstawie metod heurystycznych. Zaproponowano wykorzystanie algorytmu jako narzędzia wspomagającego pracę spedytorów do pozyskiwania opłacalnych zleceń transportowych z elektronicznych giełd transportowych.
EN
The article presents practical solutions to the problem of allocation of transport orders to available transport means in road transport. For this purpose, a comparative analysis of the selected optimization method used in the TSL industry with the own solution was made. The proposed algorithm for effective allocation of selected transport orders was developed based on heuristic methods. It was proposed to use the algorithm as a tool to support the work of shippers to obtain cost-effective transport orders from electronic transport exchanges.
2
Content available remote Workflow Region Recognition Algorithm and Its Time Complexity
Gao X., Wang X., Yang M., Liu Y.
Przegląd Elektrotechniczny
|
2013
|
R. 89, nr 1b
184--186
EN
Based on polychromatic sets theory, a new workflow model – special net structure model (SNS model) is proposed, and a concept of workflow region is defined. And then, the recognition algorithm of workflow region is presented and its time complexity is analyzed quantitatively. The compound workflow SNS model can be reduced level by level from inner to outer by invoking the recognition algorithm of workflow region. This recognition algorithm is executed only once for a lot of workflow dynamic changes. Therefore, the computing complexity is feasible and acceptable.
PL
W artykule przedstawiono propozycję nowego modelu pracy strumieniowej SNS (ang. Special Net Structure), opartego na teorii ustawień polichromatycznych oraz koncepcję obszaru pracy strumieniowej. Przeprowadzono analizę działania algorytmu rozpoznawania regionu pracy strumieniowej, jego skuteczności i stopnia komplikacji. Uzyskane wyniki wskazują na jego pełną wykonalność.
3
Content available remote Determining autocorrelation function values from six sinusoidal signal samples
Sienkowski S., Kawecka E., Mróz P.
Przegląd Elektrotechniczny
|
2013
|
R. 89, nr 11
118-120
EN
In the paper, it is shown that at a given moment of time the actual values of the sinusoidal signal autocorrelation function can be determined in an unambiguous way on the basis of three samples of the signal and three samples of its time-shifted copy. Based on this, an algorithm making it possible to determine an autocorrelogram has been devised. The employment of the devised algorithm substantially reduces the time consumption of determining an autocorrelogram.
PL
W artykule pokazano, że w ustalonej chwili czasowej rzeczywiste wartość funkcji autokorelacji sygnału sinusoidalnego można wyznaczyć w sposób jednoznaczny na podstawie trzech próbek sygnału i trzech próbek jego własnej, przesuniętej w czasie kopii. Na tej podstawie opracowano algorytm umożliwiający wyznaczanie autokorelogramu.
4
Content available A self–stabilizing algorithm for finding weighted centroid in trees
Bielak H., Pańczyk M.
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
|
2012
|
Vol. 12, no. 2
27--37
EN
In this paper we present some modification of the Blair and Manne algorithm for finding the center of a tree network in the distributed, self-stabilizing environment. Their algorithm finds n/2 -separator of a tree. Our algorithm finds weighted centroid, which is direct generalization of the former one for tree networks with positive weights on nodes. Time complexity of both algorithms is O(n2), where n is the number of nodes in the network.
5
Content available remote Edge decompositions of multigraphs into multi-2-paths
Kratochvil J., Lonc Z., Meszka M., Skupień Z.
Opuscula Mathematica
|
2004
|
Vol. 24, no. 1
97-102
EN
We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.
6
Content available remote Classification of Infinite Information Systems Depending on Complexity of Decision Trees and Decision Rule Systems
Moshkov M.Ju.
Fundamenta Informaticae
|
2003
|
Vol. 54, nr 4
345-368
EN
In this paper, infinite information systems used in pattern recognition, data mining, discrete optimization, and computational geometry are investigated. Time and space complexity of decision trees and complete decision rule systems are studied. A partition of the set of all infinite information systems into two classes is considered. Information systems from the first class are close to the best from the point of view of time and space complexity of decision trees and decision rule systems. Decision trees and decision rule systems for information systems from the second class have in the worst case large time or space complexity.
7
Content available remote A New Bayesian Tree Learning Method with Reduced Time and Space Complexity
Kłopotek M.A.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 4
349-367
EN
Bayesian networks have many practical applications due to their capability to represent joint probability distribution in many variables in a compact way. There exist efficient reasoning methods for Bayesian networks. Many algorithms for learning Bayesian networks from empirical data have been developed. A well-known problem with Bayesian networks is the practical limitation for the number of variables for which a Bayesian network can be learned in reasonable time. A remarkable exception here is the Chow/Liu algorithm for learning tree-like Bayesian networks. However, its quadratic time and space complexity in the number of variables may prove also prohibitive for high dimensional data. The paper presents a novel algorithm overcoming this limitation for the tree-like class of Bayesian networks. The new algorithm space consumption grows linearly with the number of variables n while the execution time is proportional to nźln(n), hence both are better than those of Chow/Liu algorithm. This opens new perspectives in construction of Bayesian networks from data containing tens of thousands and more variables, e.g. in automatic text categorization.
8
Content available remote A simple implementation of Dijkstra's shortest path algorithm on associative parallel processors
Nepomniaschaya A.S., Dvoskina M.A.
Fundamenta Informaticae
|
2000
|
Vol. 43, Nr 1-4
227-243
EN
In this paper we propose a natural straight forward implementation of Dijkstra's shortest path algorithm on a model of associative parallel processors of the SIMD type with bit-serial (or vertical) processing (the STAR-machine). In addition, we show how to extend this implementation for restoring the shortest path from the source vertex to a given vertex. These algorithms of implementation are represented as the corresponding STAR procedures whose correctness is verified and time complexity is evaluated.
9
Content available remote A precise version of a time hierarchy theorem
Ben-Amram A.M., Jones N.D.
Fundamenta Informaticae
|
1999
|
Vol. 38, Nr 1,2
1-15
EN
Using a simple programming language as a computational model, Neil Jones has shown that a constant-factor time hierarchy exists: thus a constant-factor difference in time makes a differ-ence in problem-solving power, unlike the situation with Turing machines. In this note we review this result and fill in the programming details in the proof, thus obtaining a precise version of the theorem with explicit constant factors. Specifically, multiplying the running time by 232 provably allows more decision problems to be solved.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.