Wyniki wyszukiwania dla: graph algorithms - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: graph algorithms

Wyniki wyszukiwania dla: graph algorithms

  • Communication and Load Balancing Optimization for Finite Element Electromagnetic Simulations Using Multi-GPU Workstation

    This paper considers a method for accelerating finite-element simulations of electromagnetic problems on a workstation using graphics processing units (GPUs). The focus is on finite-element formulations using higher order elements and tetrahedral meshes that lead to sparse matrices too large to be dealt with on a typical workstation using direct methods. We discuss the problem of rapid matrix generation and assembly, as well as...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Experimental and theoretical investigation of conformational states and noncovalent interactions in crystalline sulfonamides with a methoxyphenyl moiety

    Publikacja

    - CRYSTENGCOMM - Rok 2021

    Four sulfonamide derivatives with a methoxyphenyl moiety, namely N-{4-[(2-methoxyphenyl)sulfamoyl] phenyl}acetamide (1a), N-{4-[(3-methoxyphenyl)sulfamoyl]phenyl}acetamide (1b), 4-amino-N-(2- methoxyphenyl)benzenesulfonamide (2a) and 4-amino-N-(3-methoxyphenyl)benzenesulfonamide (2b), have been synthesized and characterized physiochemically by CHNS, MS, FT-IR, 1H NMR, 13C NMR, PXRD and TG methods. Crystal structures were determined...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Method of evaluation of lubricating ability of lube oils and fuels in energetistic formulation

    Publikacja

    The paper presents an interpretation of operation of a boundary layer of a lubricating medium. A model of the homogeneous Poisson process has been proposed to assess the deterioration process of the layer's operation. The assessment considers the original interpretation of operation of a boundary layer, as a lubricity measure of a boundary layer of any lubricant. In the submitted proposal the operation of a boundary layer is understood...

    Pełny tekst do pobrania w portalu

  • Detecting type of hearing loss with different AI classification methods: a performance review

    Publikacja
    • M. Kassjański
    • M. Kulawiak
    • T. Przewoźny
    • D. Tretiakow
    • J. Kuryłowicz
    • A. Molisz
    • K. Koźmiński
    • A. Kwaśniewska
    • P. Mierzwińska-Dolny
    • M. Grono

    - Rok 2023

    Hearing is one of the most crucial senses for all humans. It allows people to hear and connect with the environment, the people they can meet and the knowledge they need to live their lives to the fullest. Hearing loss can have a detrimental impact on a person's quality of life in a variety of ways, ranging from fewer educational and job opportunities due to impaired communication to social withdrawal in severe situations. Early...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs

    Publikacja

    - Rok 2022

    The problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...

    Pełny tekst do pobrania 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 do pobrania w portalu

  • Collision-Free Network Exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - Rok 2014

    A set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Clonal selection in discrete optimization

    Publikacja

    - Rok 2009

    W rozprawie zajmujemy się efektywnymi metodami przybliżonego rozwiązywania problemów optymalizacji dyskretnej, a w szczególności algorytmami opartymi na metodzie selekcji klonalnej (SK), należącymi do kategorii sztucznych systemów immunologicznych. Techniki optymalizacji to znaczące pole badań w informatyce, a niektóre ze starszych technik, takie jak algorytmy genetyczne, symulowane wyżarzanie czy przeszukiwanie tabu, stały się...

  • Multi-Criteria Approach in Multifunctional Building Design Process

    Publikacja

    - Rok 2017

    The paper presents new approach in multifunctional building design process. Publication defines problems related to the design of complex multifunctional buildings. Currently, contemporary urban areas are characterized by very intensive use of space. Today, buildings are being built bigger and contain more diverse functions to meet the needs of a large number of users in one capacity. The trends show the need for recognition of...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • SMART SHOP SERVICES FOR BUILDING CUSTOMER-ORIENTED SCENARIOS

    Publikacja

    The shops of today mostly support the customer by offering him or her products based on basic relationships between products viewed or ordered by users with similar tastes. This common approach may fail in many cases especially when the user does not have sufficient knowledge about the market, or when he or she wants to build a set of products in more than one shop. New categories of smart shop services are proposed in order to...

    Pełny tekst do pobrania w portalu

  • Algorytm ekstrakcji cech biometrycznych twarzy

    Publikacja

    W referacie zawarto opis metody automatycznej lokalizacji oraz parametryzacji punktów charakterystycznych w obrazie twarzy. Do lokalizacji punktów charakterystycznych wykorzystano zmodyfikowany algorytm EBGM (ang. Elastic Bunch Graph Matching). Algorytm ten pozwala lokalizować punkty w obrazie przy założeniu niezmienności topologii grafu połączeń między nimi.W referacie przedstawiono podstawy teoretyczne metody oraz zaimplementowany...

  • Brief Announcement: Energy Constrained Depth First Search

    Publikacja

    - Rok 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 do pobrania w serwisie zewnętrznym

  • Piotr Borowiecki dr hab. inż.

    Osoby

  • Agent-based social network as a simulation of a market behaviour

    Publikacja

    - Rok 2010

    Recent years and the outbreak of world's economic crisis in 2008 proved the crucial importance of reliable analysis of market dynamics. However, werarely apply models of proper detail level (the global prosperity forecast of 2007 can be seen as a grim proof). The behaviour of individuals and companies is far from being ideal and rational. Many claims that the economic paradigm of rational expectations (coming from J. Muth and R....

  • A collection of directed graphs for the minimum cycle mean weight computation

    Dane Badawcze
    open access

    This dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08   These...