Št. zadetkov: 11
Izvirni znanstveni članek
Oznake:
symbolic regression;iterated local search;ordinary least squares;ground-truth benchmark sets;
In this paper, we solve the well-known symbolic regression problem that has been
intensively studied and has a wide range of applications. To solve it, we propose an
efficient metaheuristic-based approach, called RILS-ROLS. RILS-ROLS is based on the
following two elements: (i) iterated local sear ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
graph domination problems;variable neighborhood search;simultaneous attacks;ad-hoc wireless networks;
This work focuses on developing a meta-heuristic approach to protect network nodes from simultaneous attacks, specifically addressing the k-strong Roman domination problem. The objective is to assign integer weights to the nodes, representing the number of stationed armies, to meet protection constr ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
number partitioning problem;hybrid metaheuristics;MILP models;local search;
The multidimensional multi-way number partitioning problem takes as input a set of n vectors with a fixed dimension m≥2, and aims to find a partitioning of this set into k≥2 non-empty subsets, such that the sums per coordinate across all subsets are as similar as possible. The problem has applicatio ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
combinatorial optimization;metaheuristics;graph domination;variable neighborhood search;
In this paper we are concerned with solving a generalized version of the well-known minimum dominating set problem, the so-called k-domination problem, k ∈ ℕ. This problem is about finding a minimal cardinality subset D of vertices of a graph G = (V, E) such that every υ ∈ V belongs to D or has at l ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
A* search;artificial intelligence;longest common subsequence;
This paper considers the constrained longest common subsequence problem with an arbitrary set of input strings and an arbitrary set of pattern strings as input. The problem has applications, for example, in computational biology, serving as a measure of similarity among different molecules that are ...
Leto:
2022
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
računalništvo;internet;algoritmi;
This paper deals with the restricted longest common subsequence (RLCS) problem, an extension of the well-studied longest common subsequence problem involving two sets of strings: the input strings and the restricted strings. This problem has applications in bioinformatics, particularly in identifyin ...
Leto:
2024
Vir:
Univerza v Novi Gorici (UNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
COVID-19;new daily cases;meteorological parameters;correlation;linear regression;
This study analyzes the correlation between meteorological parameters and COVID-19 new daily cases for the period March-December 2020 in three large cities in Bosnia and Herzegovina: Sarajevo, Banja Luka and Mostar. The following weather parameters were included in the analysis: the mean temperature ...
Leto:
2021
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
integer linear programming;metaheuristics;bioinformatics;adaptive and real-time control;audio querying;explainable artificial intelligence;
This paper addresses the Longest Filled Common Subsequence (LFCS) problem, a challenging NP-hard problem with applications in bioinformatics, including gene mutation prediction and genomic data reconstruction. Existing approaches, including exact, metaheuristic, and approximation algorithms, have pr ...
Leto:
2027
Vir:
Univerza v Novi Gorici (UNG)
Raziskovalni podatki
Oznake:
longest filled common subsequence;combinatorial optimization;NP-hard problems;algorithm benchmarking;benchmark instances;experimental results;reproducible research;
Leto:
2026
Vir:
Univerza v Novi Gorici (UNG)
Izvirni znanstveni članek
Oznake:
longest common subsequence;beam search;hybrid methods;variable neighborhood search;computational biology;
We consider the constrained longest common subsequence problem with an arbitrary set of input strings as well as an arbitrary set of pattern strings. This problem has applications, for example, in computational biology where it serves as a measure of similarity for sets of molecules with putative st ...
Leto:
2022
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)