Wyniki wyszukiwania dla: GREEDY ALGORITHM - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: GREEDY ALGORITHM

wyświetlamy 1000 najlepszych wyników Pomoc

Wyniki wyszukiwania dla: GREEDY ALGORITHM

  • On Computational Aspects of Greedy Partitioning of Graphs

    Publikacja

    - 2017

    In this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...

    Pełny tekst w serwisie zewnętrznym

  • The Potential of Greed for Independence

    Publikacja

    - JOURNAL OF GRAPH THEORY - 2012

    The well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...

    Pełny tekst w serwisie zewnętrznym

  • Computational aspects of greedy partitioning of graphs

    In this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...

    Pełny tekst w serwisie zewnętrznym

  • On-line P-coloring of graphs

    For a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...

    Pełny tekst w serwisie zewnętrznym

  • Dynamic F-free Coloring of Graphs

    Publikacja

    - GRAPHS AND COMBINATORICS - 2018

    A problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...

    Pełny tekst w serwisie zewnętrznym

  • Dynamic coloring of graphs

    Publikacja

    - FUNDAMENTA INFORMATICAE - 2012

    Dynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...

  • Greedy algorithms for backbone graph coloring in KOALA library

    Publikacja

    - 2012

  • Minimum order of graphs with given coloring parameters

    Publikacja

    - DISCRETE MATHEMATICS - 2015

    A complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...

    Pełny tekst 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 w serwisie zewnętrznym

  • New potential functions for greedy independence and coloring

    Publikacja

    A potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...

    Pełny tekst w serwisie zewnętrznym

  • ANYTIME POLYNOMIAL HEURISTIC ALGORITHM FOR PARTITIONING GROUPS OF DATA WITH PRESERVING CLASS PROPORTIONS

    Publikacja

    - 2014

    The article describes a problem of splitting data for k-fold cross-validation, where class proportions must be preserved, with additional constraint that data is divided into groups that cannot be split into different cross-validation sets. This problem often occurs in e.g. medical data processing, where data samples from one patient must be included in the same cross-validation set. As this problem is NP-complete, a heuristic...

  • Reliable Greedy Multipoint Model-Order Reduction Techniques for Finite-Element Analysis

    A new greedy multipoint model-order reduction algorithm for fast frequency-domain finite-element method simulations of electromagnetic problems is proposed. The location of the expansion points and the size of the projection basis are determined based on a rigorous error estimator. Compared to previous multipoint methods, the quality of the error estimator is significantly improved by ensuring the orthogonality of the projection...

    Pełny tekst w serwisie zewnętrznym

  • Greedy Multipoint Model-Order Reduction Technique for Fast Computation of Scattering Parameters of Electromagnetic

    This paper attempts to develop a new automated multipoint model-order reduction (MOR) technique, based on matching moments of the system input–output function, which would be suited for fast and accurate computation of scattering parameters for electromagnetic (EM) systems over a wide frequency band. To this end, two questions are addressed. Firstly, the cost of the wideband reduced model generation is optimized by automating a...

    Pełny tekst w serwisie zewnętrznym

  • Brief Announcement: Energy Constrained Depth First Search

    Publikacja

    - 2018

    Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...

    Pełny tekst w serwisie zewnętrznym

  • Greedy T-colorings of graphs

    Publikacja

    Treścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.

    Pełny tekst w serwisie zewnętrznym

  • On the complexity of distributed greedy coloring

    Publikacja

    - 2007

    W pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.

    Pełny tekst w serwisie zewnętrznym

  • On greedy graph coloring in the distributed model

    Artykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.

  • Knowledge management in the IPv6 migration process

    There are many reasons to deploy IPv6 protocol with IPv4 address space depletion being the most obvious. Unfortunately, migration to IPv6 protocol seems slower than anticipated. To improve pace of the IPv6 deployment, authors of the article developed an application that supports the migration process. Its main purpose is to help less experienced network administrators to facilitate the migration process with a particular target...

    Pełny tekst w serwisie zewnętrznym

  • Ryszard Katulski prof. dr hab. inż.

  • New Indoor Positioning Algorithm for Distance Measurements

    Publikacja

    - 2017

    In the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.

  • Utilization of a Non-Linear Error Function in a Positioning Algorithm for Distance Measurement Systems

    A new positioning algorithm for distance measurement systems is outlined herein. This algorithm utilizes a non-linear error function which allows us to improve the positioning accuracy in highly difficult indoor environments. The non-linear error function also allows us to adjust the performance of the algorithm to the particular environmental conditions. The well-known positioning algorithms have limitations, mentioned by their...

    Pełny tekst w serwisie zewnętrznym

  • Distributed graph searching with a sense of direction

    In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...

    Pełny tekst w serwisie zewnętrznym

  • Comparison of new position estimation algorithm for indoor environment

    Publikacja

    In the paper a new position estimation algorithm based on distance measurements is presented. This algorithm is dedicated for indoor environments. In the paper the new algorithm is compared with Chan algorithm. For the comparison were used real measurements conducted inside a building.

  • Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation

    In the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.

    Pełny tekst w serwisie zewnętrznym

  • Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations

    The paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...

  • Concept description vectors and the 20 question game

    Publikacja

    - 2005

    Knowledge of properties that are applicable to a given object is a necessary prerequisite to formulate intelligent question. Concept description vectors provide simplest representation of this knowledge, storing for each object information about the values of its properties. Experiments with automatic creation of concept description vectors from various sources, including ontologies, dictionaries, encyclopedias and unstructured...

    Pełny tekst w serwisie zewnętrznym

  • Interactive Query Expansion with the Use of Clustering by Directions Algorithm

    This paper concerns Clustering by Directions algorithm. The algorithm introduces a novel approach to interactive query expansion. It is designed to support users of search engines in forming web search queries. When a user executes a query, the algorithm shows potential directions in which the search can be continued. This paper describes the algorithm and it presents an enhancement which reduces the computational complexity of...

  • Information Retrieval with the Use of Music Clustering by Directions Algorithm

    Publikacja

    - 2013

    This paper introduces the Music Clustering by Directions (MCBD) algorithm. The algorithm is designed to support users of query by humming systems in formulating queries. This kind of systems makes it possible to retrieve songs and tunes on the basis of a melody recorded by the user. The Music Clustering by Directions algorithm is a kind of an interactive query expansion method. On the basis of query, the algorithm provides suggestions...

    Pełny tekst w serwisie zewnętrznym

  • Performance evaluation of parallel background subtraction on GPU platforms

    Implementation of the background subtraction algorithm on parallel GPUs is presented. The algorithm processes video streams and extracts foreground pixels. The work focuses on optimizing parallel algorithm implementation by taking into account specific features of the GPU architecture, such as memory access, data transfers and work group organization. The algorithm is implemented in both OpenCL and CUDA. Various optimizations of...

    Pełny tekst w serwisie zewnętrznym

  • Approximation Strategies for Generalized Binary Search in Weighted Trees

    Publikacja

    - 2017

    We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...

    Pełny tekst w serwisie zewnętrznym

  • Robust output prediction of differential – algebraic systems – application to drinking water distribution system

    Publikacja

    The paper presents the recursive robust output variable prediction algorithm, applicable for systems described in the form of nonlinear algebraic-differential equations. The algorithm bases on the uncertainty interval description, the system model, and the measurements. To improve the algorithm efficiency, nonlinear system models are linearised along the nominal trajectory. The effectiveness of the algorithm is demonstrated on...

  • Evaluation of propagation parameters of open guiding structures with the use of complex root finding algorithms

    Publikacja

    An efficient complex root tracing algorithm is utilized for the investigation of electromagnetic wave propagation in open guiding structures. The dispersion characteristics of propagated and leaky waves are calculated for a couple of chosen waveguides. The efficiency of the root tracing algorithm is discuses and compared to a global root finding algorithm.

  • 0-step K-means for clustering Wikipedia search results

    Publikacja

    - 2011

    This article describes an improvement for K-means algorithm and its application in the form of a system that clusters search results retrieved from Wikipedia. The proposed algorithm eliminates K-means isadvantages and allows one to create a cluster hierarchy. The main contributions of this paper include the ollowing: (1) The concept of an improved K-means algorithm and its application for hierarchical clustering....

  • We identified complexity of the particular steps of the algorithm that allows us to build the algorithm

    Publikacja

    - 2016

    The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...

  • Silence/noise detection for speech and music signals

    Publikacja

    - 2008

    This paper introduces a novel off-line algorithm for silence/noise detection in noisy signals. The main concept of the proposed algorithm is to provide noise patterns for further signals processing i.e. noise reduction for speech enhancement. The algorithm is based on frequency domain characteristics of signals. The examples of different types of noisy signals are presented.

  • Interactive Information Retrieval Algorithm for Wikipedia Articels

    Publikacja

    - 2012

    The article presents an algorithm for retrieving textual information in documents collection. The algorithm employs a category system that organizers the repository and using interaction with user improves search precision. The algorithm was implemented for simple English Wikipedia and the first evaluation results indicates the proposed method can help to retrieve information from large document repositories.

  • Efficient Complex Root Finding Algorithm for Microwave and Optical Propagation Problems

    Publikacja

    - 2016

    Article relates to the use of innovative root finding algorithm (on a complex plane) to study propagation properties of microwave and optical waveguides. Problems of this type occur not only in the analysis of lossy structures, but also in the study of complex and leaky modes (radiation phenomena). The proposed algorithm is simple to implement and can be applied for functions with singularities and branch cuts in the complex plane...

  • METHOD OF TRAINING THE ENDOSCOPIC VIDEO ANALYSIS ALGORITHMS TO MAXIMIZE BOTH ACCURACY AND STABILITY

    Publikacja

    In the article a new training and testing method of endoscopic video analysis algorithms is presented. Classical methods take into account only eciency of recognizing objects on single video frames. Proposed method additionally considers stability of classiers output for real video input. The method is simple and can be trained on data sets created for other solutions. Therefore, it is easily applicable to existing endoscopic video...

  • Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs

    Publikacja

    - 2011

    In the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...

    Pełny tekst w serwisie zewnętrznym

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

    Publikacja

    - Diagnostyka - 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 w serwisie zewnętrznym

  • SELECTION OF DIAGNOSTIC FUNCTIONS IN A WHEELED TRACTOR

    Publikacja

    - Diagnostyka - 2013

    In a classical approach to damage diagnosis, the technical condition of an analyzed machine is identified based on the measured symptoms, such as performance, thermal state or vibration parameters. In wheeled tractor the fundamental importance has monitoring and diagnostics during exploitation concerning technical inspection and fault element localizations. The main functions of a diagnostic system are: monitoring tractor components...

    Pełny tekst w serwisie zewnętrznym

  • APPLYING RANSAC ALGORITHM FOR FITTING SCANNING STRIPS FROM AIRBORNE LASER SCANNING

    Publikacja

    During the development of the data acquired by airborne laser scanning the important issue is the fitting and georeferencing of ALS point clouds by means of the tie surfaces and the reference planes. The process of scanning strips adjustment is based on mutual integration of point clouds (scanning strips) and their adaptation to the reference planes.In simultaneous adjustment all strips are combined into one geometrically coherent...

    Pełny tekst w serwisie zewnętrznym

  • Rendezvous of heterogeneous mobile agents in edge-weighted networks

    We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...

    Pełny tekst w serwisie zewnętrznym

  • Parallel Background Subtraction in Video Streams Using OpenCL on GPU Platforms

    Publikacja

    - 2014

    Implementation of the background subtraction algorithm using OpenCL platform is presented. The algorithm processes live stream of video frames from the surveillance camera in on-line mode. Processing is performed using a host machine and a parallel computing device. The work focuses on optimizing an OpenCL algorithm implementation for GPU devices by taking into account specific features of the GPU architecture, such as memory access,...

    Pełny tekst w serwisie zewnętrznym

  • Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm

    The paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...

    Pełny tekst w serwisie zewnętrznym

  • A non-uniform real-time speech time-scale stretching method

    Publikacja

    An algorithm for non-uniform real-time speech stretching is presented. It provides a combination of typical SOLA algorithm (Synchronous Overlap and Add ) with the vowels, consonants and silence detectors. Based on the information about the content and the estimated value of the rate of speech (ROS), the algorithm adapts the scaling factor value. The ability of real-time speech stretching and the resultant quality of voice were...

  • Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm

    The paper presents the hardware implementation of the improved alpha max plus beta min algorithm for calculating the magnitude of complex numbers. This version of the algorithm requires the general division which is performed using a noniterative multiplicative division algorithm. We analyze in detail the division algorithm, its error and the impact of finite word-length signal representations on the assumed total computation error....

    Pełny tekst w serwisie zewnętrznym

  • Sensorless algorithm for sustaining controllability of IPMSM drive in electric vehicle after resolver

    This paper presents a sensorless algorithm designated for the emergency control of an interior permanent magnet synchronous motor (IPMSM) drive in electric or hybrid vehicle. The algorithm is based on analysing the derivatives of motor phase currents measured over the duration of particular inverter states. The method is computationally simple and does not require additional hardware since the derivatives are measured indirectly....

    Pełny tekst w serwisie zewnętrznym

  • Ontology clustering by directions algorithm to expand ontology queries

    Publikacja

    - 2009

    This paper concerns formulating ontology queries. It describes existing languages in which ontologies can be queried. It focuses on languages which are intended to be easily understood by users who are willing to retrieve information from ontologies. Such a language can be, for example, a type of controlled natural language (CNL). In this paper a novel algorithm called Ontology Clustering by Directions is presented. The algorithm...

  • Comparison of various speech time-scale modificartion methods

    The objective of this work is to investigate the influence of the different time-scale modification (TSM) methods on the quality of the speech stretched up using the designed non-uniform real-time speech time-scale modification algorithm (NU-RTSM). The algorithm provides a combination of the typical TSM algorithm with the vowels, consonants, stutter, transients and silence detectors. Based on the information about the content and...