Temat: search - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Designing WDM networks by a variable neighborhood search
Autorzy:: Melian-Batista, B.
Höller, H.
Voss, S.
Powiązania:: https://bibliotekanauki.pl/articles/308920.pdf
Data publikacji:: 2006
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: network design
WDM
SDH
variable neighborhood search
Opis:: With the ever-rising data volume that is demanded by the market, network planning in order to minimize the necessary investment while meeting the demands is constantly an important task for the network providers. Synchronous digital hierarchy (SDH) and wavelength division multiplex (WDM) form the core of many current backbone networks. In order to solve the provisioning and routing problem in such WDM networks, we develop a variable neighborhood search (VNS) metaheuristic. VNS is a metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. An integer flow formulation is modeled in AMPL and solved by CPLEX in order to obtain optimal solutions as a reference for the heuristic.
Źródło:: Journal of Telecommunications and Information Technology; 2006, 4; 15-20
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Greedy randomised adaptive search procedures for topological design of MPLS networks
Autorzy:: Mysłek, A.
Powiązania:: https://bibliotekanauki.pl/articles/309269.pdf
Data publikacji:: 2002
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: network design
optimisation
MPLS
GRASP
local search
Opis:: In this paper, the IP/MPLS network cost optimisation problem of selecting localisation of nodes and links, combined with link's dimensioning, is discussed. As the considered problem is hard, we discuss and propose greedy randomised adaptive search procedure (GRASP) based solution method. GRASP is an iterative randomised sampling technique which combines adaptive randomised greedy function in constructing initial solution with local search optimisation. The effectiveness of the method is illustrated by means of a numerical study. We compare the GRASP results with results for both exact and heuristic methods obtained in previous research concerning topological design problem.
Źródło:: Journal of Telecommunications and Information Technology; 2002, 2; 26-32
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Hierarchical Multiobjective Routing in MPLS Networks with Two Service Classes - A Meta-Heuristic Solution
Autorzy:: Girao-Silva, R.
Craveirinha, J.
Clímaco, J.
Powiązania:: https://bibliotekanauki.pl/articles/308908.pdf
Data publikacji:: 2009
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: multiobjective optimization
MPLS-Internet
routing models
simulated annealing
tabu search
Opis:: The paper begins by reviewing a two-level hierarchical multicriteria routing model for MPLS networks with two service classes (QoS and BE services) and alternative routing, as well as the foundations of a heuristic resolution approach, previously proposed by the authors. Afterwards a new approach, of meta-heuristic nature, based on the introduction of simulated annealing and tabu search techniques, in the structure of the dedicated heuristic, is described. The application of the developed procedures to a benchmarking case study will show that, in certain initial conditions, this approach provides improvements in the final results especially in more "difficult" situations detected through sensitivity analysis.
Źródło:: Journal of Telecommunications and Information Technology; 2009, 3; 20-37
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Minimized Group Delay FIR Low Pass Filter Design Using Modified Differential Search Algorithm
Autorzy:: Prajapati, Sonelal
Rai, Sanjeev
Tiwari, Manish
Dwivedi, Atul Kumar
Powiązania:: https://bibliotekanauki.pl/articles/24200750.pdf
Data publikacji:: 2023
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: differential search optimization algorithm
FIR filter
optimization
small group delay
Opis:: Designing a finite impulse response (FIR) filter with minimal group delay has proven to be a difficult task. Many research studies have focused on reducing pass band and stop band ripples in FIR filter design, often overlooking the optimization of group delay. While some works have considered group delay reduction, their approaches were not optimal. Consequently, the achievement of an optimal design for a filter with a low group delay value still remains a challenge. In this work, a modified differential search optimization algorithm has been used for the purpose of designing a minimal group delay FIR filter. The results obtained have been compared with the classical techniques and they turned out to be promising.
Źródło:: Journal of Telecommunications and Information Technology; 2023, 3; 78--84
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Failure Correction of a Linear Array of Coupled Parallel Vertical Dipole Antennas
Autorzy:: Patidar, Hemant
Mahanti, Gautam Kumar
Muralidharan, R.
Singh, Prasanna Kumar
Powiązania:: https://bibliotekanauki.pl/articles/308045.pdf
Data publikacji:: 2020
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: array failure correction
cuckoo search algorithm
wide null depth
mutual coupling
Opis:: In this paper, a cuckoo search algorithm based on the combined characteristics of the brood parasite behavior and Levy ﬂights is applied to correct the radiation pattern of a linear antenna array composed of parallel dipoles with faulty elements. An eﬀort is made to restore the radiation pattern similar to one without any faulty elements, and the diﬀerence in the values of side lobe level and wide null depth of both patterns, as well as the voltage standing wave ratio obtained from the new voltage excitations become diminished. The examples presented in this paper show the eﬀectiveness of this algorithm in correcting the radiation pattern of a linear array of 36 and 120 dipole antennas with four and ten failed elements, respectively. The results show that the matching condition and the wide null control produced by Cuckoo Search algorithm are more eﬃcient in comparison with the benchmark failure correction algorithm. The approach adopted herein may be applied to other array conﬁgurations as well.
Źródło:: Journal of Telecommunications and Information Technology; 2020, 1; 62-69
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
Autorzy:: Bereta, M.
Powiązania:: https://bibliotekanauki.pl/articles/308683.pdf
Data publikacji:: 2017
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: Euclidean Steiner tree problem
MCTS
Monte Carlo Tree Search
UCT algorithm
Opis:: This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to ﬁnd a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their eﬃciency decreases when the number of terminals grows. A novel algorithm based on Upper Conﬁdence Bound for Trees is proposed. It is adapted to the speciﬁc characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed.
Źródło:: Journal of Telecommunications and Information Technology; 2017, 4; 71-81
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: The Learning System by the Least Squares Support Vector Machine Method and its Application in Medicine
Autorzy:: Szewczyk, P.
Baszun, M.
Powiązania:: https://bibliotekanauki.pl/articles/307897.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: classification
Grid-Search
particle swarm optimization (PSO)
patients diagnosis
support vector machine (SVM)
Opis:: In the paper it has been presented the possibility of using the least squares support vector machine to the initial diagnosis of patients. In order to find some optimal parameters making the work of the algorithm more detailed, the following techniques have been used: K-fold Cross Validation, Grid-Search, Particle Swarm Optimization. The result of the classification has been checked by some labels assigned by an expert. The created system has been tested on the artificially made data and the data taken from the real database. The results of the computer simulations have been presented in two forms: numerical and graphic. All the algorithms have been implemented in the C# language.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 3; 109-113
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: EWD-P as an example of a "The Best of Good Practice" project
Autorzy:: Bliźniuk, G.
Biernacka, D.
Kowalska, G.
Momotko, M.
Powiązania:: https://bibliotekanauki.pl/articles/309439.pdf
Data publikacji:: 2006
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: European Document Exchange System - Poland
EWD-P
workflow engine
classification and categorization of documents
central repository
advanced search engine
Rodan Systems
best practice project
Opis:: The European Document Exchange System - Poland (EWD-P), developed by Rodan Systems SA is one of the most modern electronic document exchange systems in European Union. EWD-P is a workflow system that facilitates decision-making within the state bureaucratic system, with a special brief to work out official Polish government standpoints on numerous legislative issues constantly arising within the EU. The EWD-P project has created an effective platform for electronic exchange of documents related to the EU legislative process. The intelligent workflow management functionality aims to support a complex flow of documents through the meanders of the central government administration. The EWD-P system includes a high-level classification of documents using an artificial intelligence technique for document categorization. The EWD-P system simplifies interaction between ministerial departments involved in elaboration of a final common position and facilitates a more efficient organization of work within government and other public administration institutions involved in the EU legislative process.
Źródło:: Journal of Telecommunications and Information Technology; 2006, 2; 15-23
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "search" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język