Wyniki wyszukiwania dla: algorithms - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: algorithms

wyświetlamy 1000 najlepszych wyników Pomoc

Wyniki wyszukiwania dla: algorithms

  • Algorithms

    Czasopisma

    ISSN: 1999-4893

  • NUMERICAL ALGORITHMS

    Czasopisma

    ISSN: 1017-1398 , eISSN: 1572-9265

  • ACM Transactions on Algorithms

    Czasopisma

    ISSN: 1549-6325 , eISSN: 1549-6333

  • Algorithms for Molecular Biology

    Czasopisma

    ISSN: 1748-7188

  • RANDOM STRUCTURES & ALGORITHMS

    Czasopisma

    ISSN: 1042-9832 , eISSN: 1098-2418

  • Continuous Optimisation Algorithms

    Publikacja

    - Rok 2016

    Książka poświęcona jest zagadnieniom optymalizacji ciągłej. Oprócz klasycznych algorytmów gradientowych omawiane są w współczesne algorytmy bezgradientowe, które stosowane są z powodzeniem w optymalizacji globalnej. Większość prezentowanych algorytmów określona może być mianem metaheurystycznych. Zaliczyć do nich można metody optymalizacji inspirowane procesami zachodzącymi w przyrodzie, które dalej można dzielić na inspirowane...

  • Finite-window RLS algorithms

    Publikacja

    - SIGNAL PROCESSING - Rok 2022

    Two recursive least-squares (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions of these algorithms. However, these two windows are not always the best choice for identification of fast time-varying systems, when the identification performance is most important. In this paper, we...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Algorithms for testing security in graphs

    In this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...

    Pełny tekst do pobrania w portalu

  • Subspace Algorithms for Face Verification

    Publikacja

    - Rok 2011

    W rzeczywistych zastosowaniach problem weryfikacji wydaje się ważniejszy od klasyfikacji. Na ogół dysponujemy jedynie niewielkim zbiorem obrazów uczących reprezentujących daną osobę, a naszym zadaniem jest podjęcie decyzji odnośnie tego, czy nowo pozyskana fotografia jest do nich wystarczająco podobna - bez użycia oddzielnego zbioru przykładów negatywnych. W takim przypadku uzasadnione wydaje się zastosowanie metody podprzestrzeni,...

  • Journal of Algorithms & Computational Technology

    Czasopisma

    ISSN: 1748-3018 , eISSN: 1748-3026

  • Discrete Mathematics Algorithms and Applications

    Czasopisma

    ISSN: 1793-8309 , eISSN: 1793-8317

  • Algorithms, Archtectures, Arrangements and Applications

    Czasopisma

    ISSN: 2326-0262

  • Comparative Analysis of microRNA-Target Gene Interaction Prediction Algorithms - The Attempt to Compare the Results of Three Algorithms

    Publikacja

    - Rok 2016

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Comparison and Analysis of Service Selection Algorithms

    Publikacja

    - Rok 2013

    In Service Oriented Architecture, applications are developed by integration of existing services in order to reduce development cost and time. The approach, however, requires algorithms that select appropriate services out of available, alternative ones. The selection process may consider both optimalization requirements, such as maximalization of performance, and constraint requirements, such minimal security or maximum development...

  • Marine and Cosmic Inspirations for AI Algorithms

    Publikacja

    Artificial Intelligence (AI) is a scientific area that currently sees an enormous growth. Various new algorithms and methods are developed and many of them meets practical, successful applications. Authors of new algorithms draw different inspirations. Probably the most common one is the nature. For example, Artificial Neural Networks were inspired by the structure of human brain and nervous system while the classic Genetic Algorithm...

    Pełny tekst do pobrania w portalu

  • New Algorithms for Adaptive Notch Smoothing

    The problem of extraction/elimination of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved using adaptive notch filtering (ANF)algorithms. It is shown that accuracy of signal estimation can be increased if the results obtained from ANF are further processed using a cascade of appropriately designed filters. The resulting adaptive notch smoothing (ANS) algorithms can be employed...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Interoperability Constraints in Service Selection Algorithms

    Publikacja

    - Rok 2012

    In Service Oriented Architecture, composite applications are developed by integration of existing, atomic services that may be available in alternative versions realizing the same functionality but having different Quality of Service (QoS) attributes. The development process requires effective service selection algorithms that balance profits and constraints of QoS attributes. Additionally, services operate in a heterogeneous environment,...

  • Evolutionary Algorithms in MPLS network designing

    Publikacja

    - Rok 2008

    MPLS technology become more and more popular especially in core networks giving great flexibility and compatibility with existing Internet protocols. There is a need to optimal design such networks and optimal bandwidth allocation. Linear Programming is not time efficient and does not solve nonlinear problems. Heuristic algorithms are believed to deal with these disadvantages and the most promising of them are Evolutionary Algorithms....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Extinction Event Concepts for the Evolutionary Algorithms

    Publikacja

    - Przegląd Elektrotechniczny - Rok 2012

    The main goal of this present paper is to propose a structure for a tool helping to determine how algorithm would react in a real live application, by checking it's adaptive capabilities in an extreme situation. Also a different idea of an additional genetic operator is being presented. As Genetic Algorithms are directly inspired by evolution, extinction events, which are elementary in our planet's development history, became...

    Pełny tekst do pobrania w portalu

  • Compression algorithms for multibeam sonar records

    Publikacja

    - HYDROACOUSTICS - Rok 2008

    Jednym z najczęściej używanych urządzeń służących do szeroko rozumianego telemonitoringu morskiego są sonary wielowiązkowe (ang. Multibeam systems MBS). Ich wysoka wydajność w tworzeniu informacji o obiektach znajdujących się pod wodą skutkuje w dużych ilościach danych pozyskiwanych podczas rejsów badawczych i pomiarowych. W tym kontekście, proces przechowywania i zarządzania takim magazynem danych staje się istotnym problemem...

    Pełny tekst do pobrania w portalu

  • Prototype selection algorithms for distributed learning

    Publikacja

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Iterative Algorithms for Multilayer Optimizing Control

    Publikacja

    - Rok 2005

    Monografia przedstawia struktury, koncepcje i algorytmy dla wielowarstwowego sterowania optymalizującego procesami przemysłowymi będące w przeważającym stopniu wynikiem badań prowadzonych przez jej autorów. Metodologie i algorytmy sterowania są starannie ilustrowane wynikami symulacji dla wybranych przykładowych systemów. Oprócz tego przedstawione są zastosowania do realnych obiektów przemysłowych: kolumny destylacyjnej etyliny,...

  • Performance Evaluation of Preemption Algorithms in MPLS Networks

    Preemption is a traffic engineering technique in Multiprotocol Switching Networks that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discuss the dilemmas in implementing preemption...

    Pełny tekst do pobrania w portalu

  • On zero-error codes produced by greedy algorithms

    We present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Swarm Algorithms in Modern Engineering Optimization Problems

    Publikacja

    Complexity of today engineering problems is constantly increasing. Scientists no longer are facing issues, for which simple, mathematical programming methods are sufficient. Issues like autonomic vehicle navigation or classification are considered to be challenging, and although there exist valid means to solve them, in some cases there still is some place for improvement. With emergence of a new type of optimization techniques...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Extending Service Selection Algorithms with Interoperability Analysis

    Application development by integration of existing, atomic services reduces development cost and time by extensive reuse of service components. In Service Oriented Architecture, there exist alternative versions of services supplying the same functionality but differing in Quality of Service (QoS) attributes, which enables developers to select services with optimal QoS. Existing algorithms of service selection focus on the formal...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Parallelization of video stream algorithms in kaskada platform

    Publikacja

    - Rok 2011

    The purpose of this work is to present different techniques of video stream algorithms parallelization provided by the Kaskada platform - a novel system working in a supercomputer environment designated for multimedia streams processing. Considered parallelization methods include frame-level concurrency, multithreading and pipeline processing. Execution performance was measured on four time-consuming image recognition algorithms,...

  • Algorithms of chemicals detection using raman spectra

    Raman spectrometers are devices which enable fast and non-contact identification of examined chemicals. These devices utilize the Raman phenomenon to identify unknown and often illicit chemicals (e.g. drugs, explosives)without the necessity of their preparation. Now, Raman devices can be portable and therefore can be more widely used to improve security at public places. Unfortunately, Raman spectra measurements is a challenge...

    Pełny tekst do pobrania w portalu

  • SEMANTIC ANALYSIS ALGORITHMS FOR KNOWLEDGE WORKERS SUPPORT

    Publikacja

    - Rok 2017

    The paper examines various aspects of text analysis application for knowledge worker’s activity realization. Conclusions are drawn about the relevance and importance of processing the non-structured textual information in order to increase knowledge worker’s efficiency, as well as their awareness in different branches of science. The paper considers the existing algorithms of texts semantic analysis as the sphere of documents topical...

    Pełny tekst do pobrania w portalu

  • STRUCTURE AND ALGORITHMS OF A DIAGNOSTIC DEVICE IN A WHEELED TRACTOR

    Publikacja

    - Diagnostyka - Rok 2013

    Diagnostic device monitors the tractor’s technical condition and identifies the location of damaged components during operation. The diagnostic device detects and identifies the following types of defects: functional defects (uf) which affect performance, exhaust defects (ue) which increase toxic emissions and fuel consumption, defects that jeopardize driving safety (us), defects that affect engine performance (ud). The key component...

    Pełny tekst do pobrania w portalu

  • Application of genetic algorithms in graph searching problem

    Graph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...

  • Multi-agent graph searching and exploration algorithms

    Publikacja

    - Rok 2020

    A team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...

    Pełny tekst do pobrania w portalu

  • Comparison of satellite chlorophyll a algorithms for the Baltic Sea

    Publikacja

    - Journal of Applied Remote Sensing - Rok 2014

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Transient detection algorithms for speech coding applications

    Publikacja

    - Journal of the Acoustical Society of America - Rok 2006

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Vehicle classification based on soft computing algorithms

    Experiments and results regarding vehicle type classification are presented. Three classes of vehicles are recognized: sedans, vans and trucks. The system uses a non-calibrated traffic camera, therefore no direct vehicle dimensions are used. Various vehicle descriptors are tested, including those based on vehicle mask only and those based on vehicle images. The latter ones employ Speeded Up Robust Features (SURF) and gradient images...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Intelligent algorithms for movie sound track restoration

    W artykule przedstawiono dwa algorytmy do rekonstruowania optycznych ścieżek dźwiękowych. Pierwszy z nich jest zastosowaniem miary nieprzewidywalności do obliczeń parametrów modelu psychoakustycznego stosowanego do redukowania szumów. Drugi stanowi precyzyjną procedurę oceny pasożytniczej modulacji częstotliwości, opartej na analizie składowych harmonicznych. Wyniki zastosowania obu wymienionych algorytmów są zawarte w artykule.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Fast algorithms for identyfication of periodiccaly varying systems.

    Praca dotyczy identyfikacji obiektów o parametrach zmieniających się w sposób okresowy. Zaproponowane algorytmy śledzenia parametrów cechują się niską złożonością obliczeniową, typową dla podejścia gradientowego a zarazem wysoką jakością śledzenia typową dla złożonych algorytmów opartych na metodzie funkcji bazowych.

  • Analysis of bandwidth reservation algorithms in HIPERLAN/2.

    Publikacja

    - Rok 2004

    Zaprezentowano metody alokacji zasobów (pasma) w systemie HIPERLAN/2. Przedyskutowano efektywność funkcjonowania typowych algorytmów pracy podwarstwy MAC oraz zaproponowano modyfikację jednego z algorytmów, polegającą na wstępnej rezerwacji pasma i okresowym uaktualnianiu przydziału zasobów. Dokonano weryfikacji symulacyjnej zaproponowanych rozwiązań.

  • An experimental study of distributed algorithms for graph coloring.

    W pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.

  • Intelligent algorithms for optical track audio restoration

    W referacie przedstawiono dwa algorytmy dedykowane redukcji pasożytniczych zniekształceń dźwięku spotykanych w optycznych ścieżkach dźwiękowych. Pierwszy algorytm umożliwia redukcję szerokopasmowego szumu w nagraniach fonicznych. Wykorzystano w nim psycho-akustyczny model słuchu oparty o miarę nieprzewidywalność sygnału (ang. Unpredictability Measure). Ocena jakości redukcji szumu została wykonana z wykorzystaniem metod inteligentnych....

  • ACM Transactions on Spatial Algorithms and Systems

    Czasopisma

    ISSN: 2374-0353 , eISSN: 2374-0361

  • World Research Journal of Transactions on Algorithms

    Czasopisma

    ISSN: 2278-845X

  • Journal of Algorithms-Cognition Informatics and Logic

    Czasopisma

    ISSN: 0196-6774

  • Efficiency comparison of selected endoscopic video analysis algorithms

    In the paper, selected image analysis algorithms were examined and compared in the task of identifying informative frames, blurry frames, colorectal cancer and healthy tissue on endoscopic videos. In order to standardize the tests, the algorithms were modified by removing from them parts responsible for the classification, and replacing them with Support Vector Machines and Artificial Neural Networks. The tests were performed in...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Comparison of edge detection algorithms for electric wire recognition

    Publikacja

    Edge detection is the preliminary step in image processing for object detection and recognition procedure. It allows to remove useless information and reduce amount of data before further analysis. The paper contains the comparison of edge detection algorithms optimized for detection of horizontal edges. For comparison purposes the algorithms were implemented in the developed application dedicated to detection of electric line...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Parameters optimization in medicine supporting image recognition algorithms

    Publikacja

    - Rok 2011

    In this paper, a procedure of automatic set up of image recognition algorithms' parameters is proposed, for the purpose of reducing the time needed for algorithms' development. The procedure is presented on two medicine supporting algorithms, performing bleeding detection in endoscopic images. Since the algorithms contain multiple parameters which must be specified, empirical testing is usually required to optimise the algorithm's...

  • Face detection algorithms evaluation for the bank client verification

    Publikacja

    Results of investigation of face detection algorithms in the video sequences are presented in the paper. The recordings were made with a miniature industrial USB camera in real conditions met in three bank operating rooms. The aim of the experiments was to check the practical usability of the face detection method in the biometric bank client verification system. The main assumption was to provide as much as possible user interaction...

  • A comparative study of English viseme recognition methods and algorithms

    An elementary visual unit – the viseme is concerned in the paper in the context of preparing the feature vector as a main visual input component of Audio-Visual Speech Recognition systems. The aim of the presented research is a review of various approaches to the problem, the implementation of algorithms proposed in the literature and a comparative research on their effectiveness. In the course of the study an optimal feature vector construction...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • GreedyMAX-type Algorithms for the Maximum Independent Set Problem

    Publikacja

    A maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Signature Partitioning Using Selected Population-Based Algorithms

    Publikacja

    - Rok 2020

    Dynamic signature is a biometric attribute which is commonly used for identity verification. Artificial intelligence methods, especially population-based algorithms (PBAs), can be very useful in the dynamic signature verification process. They are able to, among others, support selection of the most characteristic descriptors of the signature or perform signature partitioning. In this paper, we focus on creating the most characteristic...

    Pełny tekst do pobrania w serwisie zewnętrznym