Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: unconventional computing

Sortuj według:

Ogranicz wyniki do:

The Swarm Computing Approach to Business Intelligence

100%

Schumann A. , Pancerz K. , Szelc A.

nr 3

41-50

We have proposed to use some features of swarm behaviours in modelling business processes. Due to these features we deal with a propagation of business processes in all accessible directions. This propagation is involved into our formalization instead of communicating sequential processes. As a result, we have constructed a business process diagram language based on the swarm behavior and an extension of that language in the form of reflexive management language.

A Shift-free Characterization of NP within Interval-valued Computing

63%

Nagy B. , Vályi S.

tom Vol. 155, nr 1/2

187--207

Interval-valued computing is a new computing paradigm that is based on manipulations of interval-values. Interval-values are finite unions of intervals on the unit interval [0; 1) so this kind of computing can be considered as a continuous space machine like optical computing [25]. Based on the massive parallelism of this paradigm, various intractable problems can be solved efficiently, i.e., by polynomial number of steps. In this paper, the well-known complexity classes, NP and coNP are addressed. A specific subclass of polynomial size interval-valued computations is proven to characterize NP, that is, exactly languages with non-deterministically polynomial time complexity can be decided by interval-valued computations of this subclass. This specific subclass of interval-valued computations does not use any of the shift operators, moreover the product operator is used only in the starting section of the computation. Due to the fact that interval-valued computing is a deterministic model of computing, an analogue result can be established for the class coNP.