Wyniki wyszukiwania dla: EXHAUSTIVE SEARCH ALGORITHM - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: EXHAUSTIVE SEARCH ALGORITHM

Wyniki wyszukiwania dla: EXHAUSTIVE SEARCH ALGORITHM

  • Adaptive Algorithm for Interactive Question-based Search

    Publikacja

    - Rok 2012

    Popular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...

  • Context Search Algorithm for Lexical Knowledge Acquisition

    Publikacja

    - CONTROL AND CYBERNETICS - Rok 2012

    A Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...

  • A Backtracking Search Algorithm for Distribution Network Reconfiguration Problem

    Publikacja
    • T. Nguyen
    • H. Pham
    • A. Truong
    • T. Phung
    • T. Nguyen

    - Rok 2016

    Pełny tekst do pobrania w serwisie zewnętrznym

  • A Tabu Search Algorithm for Optimization of Survivable Overlay Computing Systems

    Publikacja

    - Advances in Intelligent Systems and Computing - Rok 2012

    Paradygmat obliczeń rozproszonych ostatnio zyskuje coraz większą uwagę, ponieważ zarówno instytucje przemysłowe, jak i uczelnie wymagają coraz większej mocy obliczeniowej do przetwarzania i analizy danych. Z uwagi na dużą podatność systemów obliczeń na awarie różnych typów (podobnie do systemów sieciowych), gwarancje przeżywalności niniejszych systemów są nieodzowne w celu zapewnienia nieprzerwanego działania usług. Z tego powodu,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • A Biased-Randomized Iterated Local Search Algorithm for Rich Portfolio Optimization

    Publikacja
    • R. Kizys 
    • A. Juan
    • B. Sawik
    • L. Calvet 

    - Applied Sciences-Basel - Rok 2019

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times

    Publikacja

    We consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Satellite Image Classification Using a Hierarchical Ensemble Learning and Correlation Coefficient-Based Gravitational Search Algorithm

    Publikacja
    • K. Thiagarajan
    • M. Manapakkam Anandan
    • A. Stateczny
    • P. Bidare Divakarachari
    • H. Kivudujogappa Lingappa

    - Remote Sensing - Rok 2021

    Satellite image classification is widely used in various real-time applications, such as the military, geospatial surveys, surveillance and environmental monitoring. Therefore, the effective classification of satellite images is required to improve classification accuracy. In this paper, the combination of Hierarchical Framework and Ensemble Learning (HFEL) and optimal feature selection is proposed for the precise identification...

    Pełny tekst do pobrania w portalu

  • Use of Modified Cuckoo Search algorithm in the design process of integrated power systems for modern and energy self-sufficient farms

    Publikacja

    In the face of increasingly stringent pollutant emission regulations, designing an agricultural holding becomes a difficult challenge of connecting a large number of coefficients that describe an energy system of a farm in regard to its ecological and economic efficiency. One way to cope with this issue is to design an energy self-sufficient farm that integrates various technologies, including renewable energy. However, the selection...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Auto-tuning methodology for configuration and application parameters of hybrid CPU + GPU parallel systems based on expert knowledge

    Publikacja

    Auto-tuning of configuration and application param- eters allows to achieve significant performance gains in many contemporary compute-intensive applications. Feasible search spaces of parameters tend to become too big to allow for exhaustive search in the auto-tuning process. Expert knowledge about the utilized computing systems becomes useful to prune the search space and new methodologies are needed in the face of emerging heterogeneous...

    Pełny tekst do pobrania w portalu

  • Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms

    Publikacja

    - ARTIFICIAL INTELLIGENCE - Rok 2022

    In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Scheduling of compatible jobs on parallel machines

    Publikacja

    - Rok 2021

    The dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...

  • Metaheurystyki sztucznej inteligencji w wybranych grach komputerowych

    W pracy omówiono trzy metaheurystyki sztucznej inteligencji, które mogą stać się źródłem inspiracji dla projektantów gier komputerowych. Pokazano, w jaki sposób zastosowano algorytm mrówkowy, algorytm genetyczny i algorytm tabu search w grach komputerowych zaprojektowanych przez studentów Politechniki Gdańskiej. W szczególności, odniesiono się do problematyki wyznaczania trajektorii przemieszczających się obiektów...

  • Static in vitro digestion model adapted to the general older adult population: an INFOGEST international consensus

    Publikacja
    • O. Ménard
    • U. Lesmes
    • C. S. Shani-Levi
    • A. Araiza Calahorra
    • A. Lavoisier
    • M. Morzel
    • A. Rieder
    • G. Feron
    • S. Nebbia
    • L. Mashiah... i 16 innych

    - Food & Function - Rok 2023

    Understanding the mechanisms of food digestion is of paramount importance to determine the effect foods have on human health. Significant knowledge on the fate of food during digestion has been generated in healthy adults due to the development of physiologically-relevant in vitro digestion models. However, it appears that the performance of the oro-gastrointestinal tract is affected by ageing and that a model simulating the digestive...

    Pełny tekst do pobrania w portalu

  • Fast Approximate String Search for Wikification

    Publikacja

    The paper presents a novel method for fast approximate string search based on neural distance metrics embeddings. Our research is focused primarily on applying the proposed method for entity retrieval in the Wikification process, which is similar to edit distance-based similarity search on the typical dictionary. The proposed method has been compared with symmetric delete spelling correction algorithm and proven to be more efficient...

    Pełny tekst do pobrania w portalu

  • Harmony Search for Data Mining with Big Data

    Publikacja

    - Rok 2016

    In this paper, some harmony search algorithms have been proposed for data mining with big data. Three areas of big data processing have been studied to apply new metaheuristics. The first problem is related to MapReduce architecture that can be supported by a team of harmony search agents in grid infrastructure. The second dilemma involves development of harmony search in preprocessing of data series before data mining. Moreover,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Parallel tabu search for graph coloring problem

    Publikacja

    Tabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...

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

    Publikacja

    - Rok 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....

  • Deep neural network architecture search using network morphism

    The paper presents the results of the research on neural architecture search (NAS) algorithm. We utilized the hill climbing algorithm to search for well-performing structures of deep convolutional neural network. Moreover, we used the function preserving transformations which enabled the effective operation of the algorithm in a short period of time. The network obtained with the advantage of NAS was validated on skin lesion classification...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On-line Search in Two-Dimensional Environment

    Publikacja

    We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids:...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On-line Search in Two-Dimensional Environment

    We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...

    Pełny tekst do pobrania w portalu