Search Results

The XCS Classifier System (XCS) can be considered as the most popular and most researched Learning Classifier System (LCS) and was originally intended to learn Reinforcement Learning (RL) problems. However, over time it became clear that the system ...

We look at concatenation hierarchies of classes of regular languages. Each such hierarchy is determined by a single class, its basis: level n is built by applying the Boolean polynomial closure operator "BPol" n times to the basis. An important and ...

The basis of the concept of interval valued intuitionistic fuzzy sets was introduced by K. Atanassov. Interval valued intuitionistic models provide more precision, flexibility, and compatibility to a system than a classic fuzzy mode. In this paper, we ...

Yang et al. (2013) introduced the concept of generalised bipolar fuzzy graphs in 2013. In this paper, we have introduced certain concepts of covering, matching and paired domination using strong arcs in bipolar fuzzy graphs with suitable examples. We ...

The perfect matching index of a cubic graph $G$, denoted by $\pi(G)$, is the smallest number of perfect matchings that cover all the edges of $G$. According to the Berge--Fulkerson conjecture, $\pi(G)\le5$ for every bridgeless cubic graph $G$. The class ...

We study stability properties of a given solution of a constrained equation, where the constraint has the form of the inclusion into an arbitrary closed convex set. We are mostly interested in those cases when Robinson's regularity condition does not ...

In this paper, we present lower bounds on the rank of the split closure, the multi-branch closure, and the lattice-free closure for packing sets as a function of the integrality gap. We also provide a similar lower bound on the split rank of covering ...

Rough set theory is one of the most important tools for data mining. The covering rough set (CRS) model is an excellent generalization of Pawlak rough sets. In this paper, we first investigate a number of basic properties of two types of CRS models. ...

Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have applications in graph ...

We show the following for every sufficiently connected graph G, any vertex subset S of G, and given integer k: there are k disjoint odd cycles in G each containing a vertex of S or there is set X of at most 2k-2 vertices such that G-X does not contain ...

The concepts of covering and matching in an intuitionistic fuzzy graph using strong arcs are introduced and established many interesting properties on it. The notion of paired domination in intuitionistic fuzzy graph using strong arcs is also studied. The ...

In this paper, we study covering-based multigranulation decision-theoretic rough sets in a multi-covering space. From viewpoints of granule, we propose the notions of covering-based mean multigranulation decision-theoretic rough sets, covering-based ...

Given a digraph D = (V, A) and a positive integer k, an arc set F ⊆ A is called a k-arborescence if it is the disjoint union of k spanning arborescences. The problem of finding a minimum cost k-arborescence is known to be polynomial-time solvable using ...

As an extension of the classical Pawlak rough sets, covering multigranulation trapezoidal fuzzy decision-theoretic rough set models have been researched, in which objects approximated are crisp sets or accurate concepts of the universe of discourse, and ...

Rough set theory is an important non-numeric method for dealing with uncertainty and data mining. In this paper, we study rough sets and rough fuzzy sets on two universes via covering models. We introduce a new definition for the lower and upper ...

We investigate gcf-Petri nets, a generalization of communication-free Petri nets allowing arbitrary arc multiplicities, and characterized by the sole restriction that each transition has at most one incoming arc. We use canonical firing sequences with ...

Given two 3-uniform hypergraphs $F$ and $G=(V,E)$, we say that $G$ has an $F$-covering if we can cover $V$ with copies of $F$. The minimum codegree of $G$ is the largest integer $d$ such that every pair of vertices from $V$ is contained in at least $d$ ...

In rough set theory, attributes importance measure is a crucial factor in applications of attribute reduction and feature selection. Many importance measure methodologies for discrete-valued information system or decision table have been developed. ...

We give a lower bound on the iteration complexity of a natural class of Lagrangian-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$ variables, with high ...

Video summarization is a simplification of video content for compacting the video information. The video summarization problem can be transformed to a clustering problem, in which some frames are selected to saliently represent the video content. In ...