Ograniczanie wyników
Czasopisma help
Lata help
Autorzy help
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Znaleziono wyników: 91
first rewind previous Strona / 5 next fast forward last
Wyszukiwano:
w słowach kluczowych:  dynamic programming
help Sortuj według:

help Ogranicz wyniki do:
1
100%
Archives of Acoustics
EN The important element of today's speech systems is the set of recorded wavefiles annotated by a sequence of phonemes and boundary time-points. As the manual segmentation of speech is a very laborious task, there is the need for automatic segmentation algorithms. However, it was observed that common [...]
2
100%
Foundations of Computing and Decision Sciences
EN In this paper a techique allowing the use od Dynamic Programming in the large-dimensional cases of systems is presented. Classic Dynamic Programming usually collapses with large scale systems due to the enormous computational cost of system simulation. Active Dynamic Programming makes use of additio[...]
3
100%
Control and Cybernetics
2014 Vol. 43, no. 3 379--401
EN We provide a dynamic programming approach through the level set setting to structural optimization problems. By constructing a dual dynamic programming method we provide the verification theorem for optimal and "−optimal solutions of shape optimization problem.
4
80%
Diagnostyka
2012 nr 3(63) 55-58
PL Celem artykułu jest przybliżenie idei pełnego warunkowego programu diagnozowania oraz adaptacji dla jego potrzeb programowania dynamicznego według zasady optymalności Bellmana. Uczyniono to w odniesieniu do szeregowego połączenia czterech przewodów elektrycznych.
EN The approach the idea of full conditional program for diagnosing is the aim of article as well as the adaptation for his needs the dynamic programming according to Bellman's principle of optimality. This was made in reference to serial connection four electric lines.
5
80%
Prace Naukowe Instytutu Matematyki Politechniki Wrocławskiej. Konferencje
EN Credit risk management methods can be divided in two classes: static (optimization of credit granting) and dynamic (optimal risk management for an existing account). The methods from the second class are applied, among other things, to setting credit line limit of. This paper introduces two models. [...]
6
80%
Fundamenta Informaticae
EN This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows [...]
7
80%
Fundamenta Informaticae
EN Based on dynamic programming approach we design algorithms for sequential optimization of exact and approximate decision rules relative to the length and coverage [3, 4]. In this paper, we use optimal rules to construct classifiers, and study two questions: (i) which rules are better from the point [...]
8
80%
Mechanika / Akademia Górniczo-Hutnicza im. St. Staszica
PL W opracowaniu przedstawiono opracowaną w formie programu komputerowego metodę obliczeniową SDLPK, służącą do wyznaczania optymalnych okresów wykonywania odnów profilaktycznych obiektów technicznych. Metoda opiera się na schematach decyzyjno--losowych i programowaniu dynamicznym. Poprawność obliczeni[...]
EN In this paper the calculation method of determination the timescale of preventive renew has been presented. This method has been worked out like a computer program. The model makes use of decision - random schemes and dynamie programming. The results of the calculation in this program have been pres[...]
9
80%
Bulletin of the Polish Academy of Sciences. Technical Sciences
EN Feedforward neural networks are usually used for functions approximation [1]. This feature of such a class of networks is explained in the paper by Cybenko [2]. In literature we can find many different application of neural networks as universal approximators [3], [4]. It seems that one of the most [...]
10
80%
Fundamenta Informaticae
EN We consider a version of pattern matching useful in processing large musical data: d-matching, which consists in finding matches which are d-approximate in the sense of the distance measured as maximum difference between symbols. The alphabet is an interval of integers, and the distance between two [...]
11
80%
Control and Cybernetics
2013 Vol. 42, no. 3 593--612
EN This article concerns the optimal stopping problem for a discrete-time Markov chain with observable states, but with unknown transition probabilities. A stopping policy is graded via the expected total-cost criterion resulting from the non-negative running and terminal costs. The Dynamic Programming[...]
12
80%
Fundamenta Informaticae
EN The paper describes a new tool for study relationships between length and coverage of exact decision rules. This tool is based on dynamic programming approach. We also present results of experiments with decision tables from UCI Machine Learning Repository.
13
80%
Fundamenta Informaticae
2014 Vol. 129, nr 4 329--340
EN The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a word which reads the same forward as it does backward. The longest common palindromic subsequence (LCPS) problem is a variant of the classic LCS problem which finds a longest commo[...]
14
80%
Fundamenta Informaticae
2016 Vol. 145, nr 2 151--170
EN In this paper, we develop a novel graph theoretic approach for protein threading. In order to perform the protein sequence-structure alignment in threading both efficiently and accurately, we develop a graph model to describe the tertiary structure of a protein family and the alignment between a seq[...]
15
80%
Metrology and Measurement Systems
2017 Vol. 24, nr 1 161--173
EN Precise measurement of rail vehicle velocities is an essential prerequisite for the implementation of modern train control systems and the improvement of transportation capacity and logistics. Novel eddy current sensor systems make it possible to estimate velocity by using cross-correlation techniqu[...]
16
80%
Fundamenta Informaticae
2005 Vol. 65, nr 4 291--305
EN Simple least-significant-bit (LSB) substitution is the most straightforward way to embed the secret image in the host image. Based on the simple LSB substitution, the method using substitution table is proposed to improve the quality of the stego-image. In this paper, we shall bring up a new method [...]
17
80%
International Journal of Electronics and Telecommunications
2017 Vol. 63, No. 3 279--283
EN Wireless Multimedia Sensor Networks (WMSNs) advances can route multimedia applications from source nodes to a sink. However, they require energy efficiency and network lifetime due to limited power resources in the sensor nodes. This paper proposes an energy-efficient routing optimization for multim[...]
18
80%
Operations Research and Decisions
EN A method for the allocation of technologies of reduction of CO2 emission to sources of emissions based on dynamic programming has been described. The purpose of the application of the method was to develop an efficient strategy of allocating financial means for reducing CO2 emissions from a set of c[...]
19
80%
Fundamenta Informaticae
EN The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C of A and B such that P is a subsequence of C. Most of the algorithms solving the CLCS problem are based[...]
20
80%
Technical Sciences / University of Warmia and Mazury in Olsztyn
2017 nr 20(2) 149--160
EN It is discussed the using of dynamic programming method to optimize the parameters of the cascade of ideal mixing reactors, which is held isothermal first order reaction. It is found, that the minimum volume of the cascade of reactors corresponds to the minimum residence time of substance in this ca[...]
first rewind previous Strona / 5 next fast forward last