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ę "A* algorithm" wg kryterium: Temat


Tytuł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The EM Algorithm applied to determining new limit points of Mahler measures
Autorzy:
El Otmani, S.
Rhin, G.
Sac-Epee, J. M.
Powiązania:
https://bibliotekanauki.pl/articles/970173.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Mahler measure
EM algorithm
Opis:
In this work, we propose new candidates expected to be limit points of Mahler measures of polynomials. The tool we use for determining these candidates is the Expectation-Maximization algorithm, whose goal is to optimize the likelihood for the given data points, i.e. the known Mahler measures up to degree 44, to be generated by a specific mixture of Gaussians. We will give the mean (which is a candidate to be a new limit point) and the relative amplitude of each component of the more likely gaussian mixture.
Źródło:
Control and Cybernetics; 2010, 39, 4; 1185-1192
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New estimate for the curvature of an order-convex set and related questions
Autorzy:
Ramazanov, Ali B.
Powiązania:
https://bibliotekanauki.pl/articles/2050043.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
gradient
estimates
curvature
convexity
algorithm
Opis:
It is well known that in discrete optimization problems, gradient (local) algorithms do not always guarantee an optimal solution. Therefore, the problem arises of finding the accuracy of the gradient algorithm. This is a fairly well-known problem and numerous publications have been devoted to it. In establishing accuracy, various approaches are used. One of these approaches is to obtain guaranteed estimates of the accuracy of the gradient algorithm in terms of the curvature of the admissible domain. With this approach, it is required to find the curvatures of the admissible region. Since finding the exact value of curvature is a difficult problem to solve, curvature estimates in terms of more or less simply calculated parameters of the problem are relevant. A new improved bound for the curvature of an order-convex set is found and is presented in this paper in terms of the steepness and parameters of strict convexity of the function.
Źródło:
Control and Cybernetics; 2020, 49, 2; 233-240
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neural network-based allocation and self-improved firefly-based optimal sizing of fuel cells in distributed generation systems
Autorzy:
Subramanyam, T. C.
Tulasi Ram, S. S.
Subrahmanyam, J. B. V.
Powiązania:
https://bibliotekanauki.pl/articles/1839111.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
DG system
fuel cells
location
sizing
multiple objectives
firefly algorithm
self-improved firefly algorithm
Opis:
The notion of Distributed Generation (DG) refers to the production of power at the level of consumption. Production of energy on-site, instead of offering it centrally, reduces the cost, internal dependencies, difficulties, inefficiencies, and risks that are related to transmission and distribution systems. In case DG is realized with fuel cells, several issues exist in respect to allocating and sizing of these fuel cells in the system. For solving those issues, dual stage intelligent technique is employed in this paper. First, the Neural Networks (NN) technique is adopted for determining the required location to place the fuel cells. Secondly, an enhanced version of Self Improved Fire-Fly (SIFF) algorithm is adopted for finding the optimal size of the fuel cells. The implemented technique is simulated in four IEEE benchmark test bus systems, and the respective performance analysis along with statistical analysis serves for validation purposes. The here proposed technique is compared with six other known algorithms, namely Particle Swarm Optimization (PSO), Firefly (FF) algorithm, Artificial Bee colony (ABC) algorithm, Improved Artificial Bee colony algorithm (IABC), Genetic Algorithm (GA) and Global Search Optimizer (GSO). The results obtained from the comparative analysis show the enhanced performance of the proposed mechanism.
Źródło:
Control and Cybernetics; 2018, 47, 4; 357-381
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the block decomposition and spectral factors of λ-matrices
Autorzy:
Bekhiti, Belkacem
Nail, Bachir
Dahimene, Abdelhakim
Hariche, Kamel
Fragulis, George F.
Powiązania:
https://bibliotekanauki.pl/articles/2049949.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
block roots
solvents
spectral factors
block-Q.D. algorithm
block-Horner’s algorithm
matrix polynomials
Opis:
In this paper we have factorized matrix polynomials into a complete set of spectral factors using a new design algorithm, and with some systematic procedures a complete set of block roots (solvents) have been obtained. The newly developed procedure is just an extension of the (scalar) Horner method to its block form for use in the computation of the block roots of matrix polynomial, the block-Horner method bringing a local iterative nature, faster convergence, nested programmable scheme, needless of any prior knowledge of the matrix polynomial, with the only one inconvenience, which is the strong dependence on the initial guess. In order to avoid this trap, we proposed a combination of two computational procedures, for which the complete program starts with the right block-Q.D. algorithm. It is then followed by a refinement of the right factor by block-Horner’s algorithm. This results in the global nature of the program, which is faster in execution, has well defined initial conditions, and good convergence in much less time.
Źródło:
Control and Cybernetics; 2020, 49, 1; 41-76
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
Ant colony metaphor in a new clustering algorithm
Autorzy:
Boryczka, U.
Powiązania:
https://bibliotekanauki.pl/articles/969824.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
data mining
cluster analysis
ant clustering algorithm
Opis:
Among the many bio-inspired techniques, ant clustering algorithms have received special attention, especially because they still require much investigation to improve performance, stability and other key features that would make such algorithms mature tools for data mining. Clustering with swarm-based algorithms is emerging as an alternative to more conventional clustering methods, such as k-means algorithm. This proposed approach mimics the clustering behavior observed in real ant colonies. As a case study, this paper focuses on the behavior of clustering procedures in this new approach. The proposed algorithm is evaluated on a number of well-known benchmark data sets. Empirical results clearly show that the ant clustering algorithm (ACA) performs well when compared to other techniques.
Źródło:
Control and Cybernetics; 2010, 39, 2; 343-358
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new concept of an artificial ecosystem algorithm for optimization problems
Autorzy:
Baczynski, D.
Powiązania:
https://bibliotekanauki.pl/articles/205935.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
artificial ecosystem algorithm
optimization
computational intelligence methods
Opis:
This article provides, first, a review of applications of the ecosystem idea in different computational intelligence methods. The article presents the bases of ecosystem operation and a new concept for modelling the phenomena occurring in an ecosystem, with the aim of using these for optimization purposes. The author’s original form of the Artificial Ecosystem Algorithm (AEA) and its constituent parts are presented. The construction of the proposed algorithm was dedicated for continuous optimisation. The operation of the Artificial Ecosystem Algorithm is also compared with an Evolutionary Algorithm and PSO for six test functions for various numbers of variables. Conclusions concerning operation, structure and complexity of AEA are provided at the end.
Źródło:
Control and Cybernetics; 2016, 45, 1; 5-36
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Canonical greedy algorithms and dynamic programming
Autorzy:
Lew, A.
Powiązania:
https://bibliotekanauki.pl/articles/970856.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie dynamiczne
Dijkstra
greedy algorithm
dynamic programming
Opis:
There has been little work on how to construct greedy algorithms to solve new optimization problems efficiently. Instead, greedy algorithms have generally been designed on an ad hoc basis. On the other hand, dynamic programming has a long history of being a useful tool for solving optimization problems, but is often inefficient. We show how dynamic programming can be used to derive efficient greedy algorithms that are optimal for a wide variety of problems. This approach also provides a way to obtain less efficient but optimal solutions to problems where derived greedy algorithms are nonoptimal.
Źródło:
Control and Cybernetics; 2006, 35, 3; 621-643
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dijkstras algorithm revisited: the dynamic programming connexion
Autorzy:
Sniedovich, M.
Powiązania:
https://bibliotekanauki.pl/articles/970872.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie dynamiczne
badania operacyjne
Dijkstra's algorithm
dynamic programming
greedy algorithm
principle of optimality
successive approximation
operations research
computer science
Opis:
Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.
Źródło:
Control and Cybernetics; 2006, 35, 3; 599-620
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extending k-means with the description comes first approach
Autorzy:
Stefanowski, J.
Weiss, D.
Powiązania:
https://bibliotekanauki.pl/articles/970926.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
document clustering
cluster labels
k-means algorithm
information retrieval
Opis:
This paper describes a technique for clustering large collections of short and medium length text documents such as press articles, news stories and the like. The technique called description comes first (DCF) consists of identification of related document clusters, selection of salient phrases relevant to these clusters and reallocation of documents matching the selected phrases to form final document groups. The advantages of this technique include more comprehensive cluster labels and clearer (more transparent) relationship between cluster labels and their content. We demonstrate the DCF by taking a standard k-means algorithm as a baseline and weaving DCF elements into it; the outcome is the descriptive k-means (DKM) algorithm. The paper goes through technical background explaining how to implement DKM efficiently and ends with the description of an experiment measuring clustering quality on a benchmark document collection 20-newsgroups. Short fragments of this paper appeared at the poster session of the RIAO 2007 conference, Pittsburgh, PA, USA (electronic proceedings only).
Źródło:
Control and Cybernetics; 2007, 36, 4; 1009-1035
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Revisiting the analysis of optimal control problems with several state constraints
Autorzy:
Bonnans, J. F.
Hermant, A.
Powiązania:
https://bibliotekanauki.pl/articles/970908.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optimal control
state constraints
shooting algorithm
second order optimality conditions
Opis:
This paper improves the results of and gives shorter proofs for the analysis of state constrained optimal control problems than presented by the authors in Bonnans and Hermant (2009b), concerning second order optimality conditions and the well-posedness of the shooting algorithm. The hypothesis for the second order necessary conditions is weaker, and the main results are obtained without reduction to the normal form used in that reference, and without analysis of high order regularity results for the control. In addition, we provide some numerical illustration. The essential tool is the use of the "alternative optimality system".
Źródło:
Control and Cybernetics; 2009, 38, 4A; 1021-1052
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinearity of the round function
Autorzy:
Kontak, M.
Szmidt, J.
Powiązania:
https://bibliotekanauki.pl/articles/1839189.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Boolean functions
substitution boxes
Walsh transform
linear cryptanalysis
TGR algorithm
Opis:
In the paper we present the results which enable to calculate the nonlinearity of the round function with quite large dimensions, e.g. 32 x 32 bits, which are used in some block ciphers. It can be used to estimate resistance of these ciphers against linear cryptanalysis. We give the application to linear cryptanalysis of the TGR block cipher.
Źródło:
Control and Cybernetics; 2007, 36, 4; 1037-1044
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A primal-infeasible interior point algorithm for linearly constrained convex programming
Autorzy:
Wang, Y.
Fei, P.
Powiązania:
https://bibliotekanauki.pl/articles/969664.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linearly constrained convex programming
primal-infeasible interior point algorithm
polynomial complexity
Opis:
In this paper a primal-infeasible interior point algorithm is proposed for linearly constrained convex programming. A positive primal-infeasible dual-feasible point can be taken as the starting point of this algorithm in a large region. At each iterates it requires to solve approximately a nonlinear system. The polynomial complexity of the algorithm is obtained. It is shown that, after finite iterations a sufficiently good approximation to the optimal point is found, or there is no optimal point in a large region.
Źródło:
Control and Cybernetics; 2009, 38, 3; 687-704
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Passivity-based optimal control of discrete-time nonlinear systems
Autorzy:
Binazadeh, T.
Shafiei, M. H.
Powiązania:
https://bibliotekanauki.pl/articles/205917.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
nonlinear discrete-time systems optimal passivity-based control
genetic optimization algorithm
Opis:
In this paper, a passivity-based optimal controlmethod for a broad class of nonlinear discrete-time systems is proposed. The resulting control law is a static output feedback law which is practically preferred with respect to the state feedback law and is simple to implement. The control law has a general structure with adjustable parameters which are tuned, using an optimization method (genetic algorithm), to minimize an arbitrary cost function. By choosing this cost function it is possible to shape the transient response of the closed-loop system, as it is desirable. An illustrative ex ample shows the effectiveness of the proposed approach.
Źródło:
Control and Cybernetics; 2013, 42, 3; 627-637
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł

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