Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "A* algorithm" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 1766
Tytuł:
A linear algorithm for the two paths problem on permutation graphs
Autorzy:
Gopalakrishnan, C.
Pandu Rangan, C.
Powiązania:
https://bibliotekanauki.pl/articles/972048.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
algorithm
bridge
connectivity
disjoint paths
permutation graph
two paths problem
Opis:
The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two vertex-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂ respectively. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph.
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 2; 147-166
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Edge-disjoint paths in permutation graphs
Autorzy:
Gopalakrishnan, C.
Pandu Rangan, C.
Powiązania:
https://bibliotekanauki.pl/articles/971918.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
algorithm
bridge
connectivity
disjoint paths
permutation graph
Opis:
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two edge-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂, respectively. We give a linear (O(|V|+|E|)) algorithm to solve this problem on a permutation graph.
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 1; 59-72
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spanning trees with many or few colors in edge-colored graphs
Autorzy:
Broersma, Hajo
Li, Xueliang
Powiązania:
https://bibliotekanauki.pl/articles/971955.pdf
Data publikacji:
1997
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge-coloring
spanning tree
matroid (intersection)
complexity
NP-complete
NP-hard
polynomial algorithm
(minimum) dominating set
Opis:
Given a graph G = (V,E) and a (not necessarily proper) edge-coloring of G, we consider the complexity of finding a spanning tree of G with as many different colors as possible, and of finding one with as few different colors as possible. We show that the first problem is equivalent to finding a common independent set of maximum cardinality in two matroids, implying that there is a polynomial algorithm. We use the minimum dominating set problem to show that the second problem is NP-hard.
Źródło:
Discussiones Mathematicae Graph Theory; 1997, 17, 2; 259-269
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Convergence acceleration by the $E_{+p}$-algorithm
Autorzy:
Fdil, A.
Powiązania:
https://bibliotekanauki.pl/articles/1339005.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
convergence acceleration
E-algorithm
linear periodic convergence
numerical quadrature
Opis:
A new algorithm which generalizes the E-algorithm is presented. It is called the $E_{+p}$-algorithm. Some results on convergence acceleration for the $E_{+p}$-algorithm are proved. Some applications are given.
Źródło:
Applicationes Mathematicae; 1998-1999, 25, 3; 327-338
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Directed forests with application to algorithms related to Markov chains
Autorzy:
Pokarowski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1338687.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
entrywise relative error
directed forest
Matrix Tree Theorem
directed graph
Simulated Annealing
Markov chains
Metropolis algorithm
direct methods for linear systems
nearly completely decomposable Markov chains
aggregation algorithms
nonhomogeneous Markov chains
Markov Chain Tree Theorem
Markov chain Monte Carlo algorithms
Gibbs sampler
Opis:
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Źródło:
Applicationes Mathematicae; 1999, 26, 4; 395-414
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Semi-Markov control models with average costs
Autorzy:
Luque-Vásquez, Fernando
Hernández-Lerma, Onésimo
Powiązania:
https://bibliotekanauki.pl/articles/1338792.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
average cost
replacement models
semi-Markov control models
policy iteration (or Howard's algorithm)
Opis:
This paper studies semi-Markov control models with Borel state and control spaces, and unbounded cost functions, under the average cost criterion. Conditions are given for (i) the existence of a solution to the average cost optimality equation, and for (ii) the existence of strong optimal control policies. These conditions are illustrated with a semi-Markov replacement model.
Źródło:
Applicationes Mathematicae; 1999, 26, 3; 315-331
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A primal-dual integral method in global optimization
Autorzy:
Hichert, Jens
Hoffmann, Armin
Phú, Huan
Reinhardt, Rüdiger
Powiązania:
https://bibliotekanauki.pl/articles/729363.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
global optimization
integral method
Monte Carlo method
primal dual algorithm
level set method
Opis:
Using the Fenchel conjugate $F^c$ of Phú's Volume function F of a given essentially bounded measurable function f defined on the bounded box D ⊂ Rⁿ, the integral method of Chew and Zheng for global optimization is modified to a superlinearly convergent method with respect to the level sequence. Numerical results are given for low dimensional functions with a strict global essential supremum.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 257-278
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assignment and sequencing of parts to autonomous workstations
Autorzy:
Lucertini, M.
Nicolo, F.
Smriglio, S.
Powiązania:
https://bibliotekanauki.pl/articles/206675.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sterowanie porodukcją
teoria algorytmów
teoria systemów
złożoność obliczeniowa
bipartie matching
coordination mechanism
distributed algorithm
polynomial-time algorithm
Opis:
We present an optimization-based coordination protocol among autonomous workstations in a multiprocessor stage devoted to painting of the shutters in a furniture production process. The coordination aims to maximize the number of parallel operations executable at each machine cycle, while fulfilling constraints on the unique-copy tools. The mechanism is derived by a distributed implementation of a bipartite matching algorithm. The resulting procedure is shown to be compatible with the several autonomous decisions characterizing the process.
Źródło:
Control and Cybernetics; 2000, 29, 1; 221-236
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Correlational parameter tuning by genetic meta-algorithm
Autorzy:
Kieś, P.
Kosiński, W.
Powiązania:
https://bibliotekanauki.pl/articles/206578.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
adaptacja
algorytm genetyczny
optymalizacja
permutacja kodowa
strojenie parametrów
adaptation
code permutation
genetic algorithm
optimization
parameter tuning
Opis:
The general problem of an off-line parameter tuning in the Binary Genetic Algorithm (BGA) is introduced. An example of such a tuning: a class of Correlational Tuning Methods (CTMs) is proposed. The main idea of a CTM is that it uses a mapping called measurement function as an assessment of the BGA's effciency. An example of a measurement function is described and two examples of CTMs: a modified "trials and errors" method and a modified genetic meta-algoritlm (metaBGA) are shown. Finally, experimental results with the metaBGA for four kinds of test fitness functions, where the code permutation is the tuned parameter, are presented.
Źródło:
Control and Cybernetics; 2000, 29, 4; 1031-1042
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fornasini-Marchesini 2-D State Space Models: Transfer Function Computation Via the Dft
Autorzy:
Antoniou, G.
Emmons, K.
Powiązania:
https://bibliotekanauki.pl/articles/911185.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
teoria systemów
transformata Fouriera
two dimensions system theory
Fourier transform
DFT algorithm
Fornasini-Marchesini's model
Opis:
A new algorithm is presented for the computation of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given two-dimensional (2-D) state space model of Fornasini-Marchesini type. The algorithm has been implemented in Matlab and uses the discrete Fourier transform (DFT). The simplicity and efficiency of the technique are illustrated by two examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 321-331
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the choice of statistical model for one-dimensional P-algorithms
Autorzy:
Calvin, J.
Zilinskas, A.
Powiązania:
https://bibliotekanauki.pl/articles/205977.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
analiza statystyczna
model statystyczny
optymalizacja
prawdopodobieństwo
algorithm
asymptotic properties
convergence
optimization
probability
statistical analysis
statistical models
Opis:
Algorithms based on statistical models compete favorably with other global optimization algorithms as proved by extensive testing results. Recently, techniques were developed for theoretically estimating the rate of convergence of global optimization algorithms with respect to the underlying statistical models. In the present paper these technictues are extended for theoretical investigation of P-algorithms without respect to a statistical model. Theoretical estimates may eliminate the need for lengthy experimental investigation which previously was the only method for comparison of the algorithms. The rcaults obtained give new insight into the role of the mnderlying statistical model with respect to the asymptotic properties of the algorithm which will be useful for the implementation of new versions of the algoritlmns.
Źródło:
Control and Cybernetics; 2000, 29, 2; 555-565
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Persistency in the Traveling Salesman Problem on Halin graphs
Autorzy:
Lacko, Vladimír
Powiązania:
https://bibliotekanauki.pl/articles/743793.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
persistency
traveling salesman problem
Halin graph
polynomial algorithm
Opis:
For the Traveling Salesman Problem (TSP) on Halin graphs with three types of cost functions: sum, bottleneck and balanced and with arbitrary real edge costs we compute in polynomial time the persistency partition $E_{All}$, $E_{Some}$, $E_{None}$ of the edge set E, where:
$E_{All}$ = {e ∈ E, e belongs to all optimum solutions},
$E_{None}$ = {e ∈ E, e does not belong to any optimum solution} and
$E_{Some}$ = {e ∈ E, e belongs to some but not to all optimum solutions}.
Źródło:
Discussiones Mathematicae Graph Theory; 2000, 20, 2; 231-242
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robust Dynamic Input Reconstruction for Delay Systems
Autorzy:
Kappel, F.
Maksimov, V.
Powiązania:
https://bibliotekanauki.pl/articles/911173.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system opóźniania
obserwacja
delay system
input reconstruction
observation
robust algorithm
Opis:
A problem of reconstruction of a non-observable control input for a system with a time delay is analyzed within the framework of the dynamical input reconstruction approach (see Kryazhimskii and Osipov, 1987; Osipov and Kryazhimskii, 1995; Osipov et al., 1991). In (Maksimov, 1987; 1988) methods of dynamical input reconstruction were described for delay systems with fully observable states. The present paper provides an input reconstruction algorithm for partially observable systems. The algorithm is robust to the observation perturbations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 283-307
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Variable- and Fixed-Structure Augmented Interacting Multiple-Model Algorithms for Manoeuvring Ship Tracting Based on New Ship Models
Autorzy:
Semerdjiev, E.
Mihaylova, L.
Powiązania:
https://bibliotekanauki.pl/articles/911219.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model niepewności
estymacja parametryczna
Interacting Multiple Model (IMM) algorithm
model uncertainty
state and parameter estimation
Opis:
Real-world tracking applications are related to a number of difficulties caused by the presence of different kinds of uncertainty, e.g. unknown or incompletely known system models and statistics of random processes or abrupt changes in the system modes of functioning. These problems are especially complicated in the marine navigation practice, where the commonly-used simple models of rectilinear or curvilinear target motions are not adequate for highly non-linear dynamics of the manoeuvring ship motion. A solution to these problems is to derive more suitable descriptions of real ship dynamics and to design adaptive estimation algorithms. After an analysis of basic hydrodynamic models, new ship models are derived in the paper. They are implemented in two versions of the Interacting Multiple Model (IMM) algorithm which has become very popular recently. The first one is a standard IMM version based on fixed model structures (FS's). They represent various modes of ship motion, distinguished by their rates of turns. The same rate of turn is additionally adjusted in the proposed new augmented versions of the IMM (AIMM) algorithm by using FS's and variable structures (VS's) of adaptive models estimating the current change in the system control parameters. Monte Carlo simulation experiments indicate that the VS AIMM algorithm outperforms the FS AIMM and FS IMM ones with respect to both accuracy and adaptability.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 591-604
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An attractive class of bipartite graphs
Autorzy:
Boliac, Rodica
Lozin, Vadim
Powiązania:
https://bibliotekanauki.pl/articles/743515.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
bipartite graphs
structural characterization
polynomial algorithm
Opis:
In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2001, 21, 2; 293-301
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 1766

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