PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 10

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  complexity theory
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Scheduling Jobs to Minimize a Convex Function of Resource Usage
Szögi Evelin, Kis Tamas
Annals of Computer Science and Information Systems
|
2023
|
Vol. 35
791--799
EN
In this paper we describe polynomial time algorithms for minimizing a separable convex function of the resource usage over time of a set of jobs with individual release dates and deadlines, and admitting a common processing time.
2
Content available remote Hashtag Discernability - Competitiveness Study of Graph Spectral and Other Clustering Methods
Starosta Bartłomiej, Kłopotek Mieczysław, Wierzchoń Slawomir T., Czerski Dariusz
Annals of Computer Science and Information Systems
|
2023
|
Vol. 35
759--767
EN
Spectral clustering methods are claimed to possess ability to represent clusters of diverse shapes, densities etc. They constitute an approximation to graph cuts of various types (plain cuts, normalized cuts, ratio cuts). They are applicable to unweighted and weighted similarity graphs. We perform an evaluation of these capabilities for clustering tasks of increasing complexity.
3
Content available remote Efficient Deep Learning Approach for Olive Disease Classification
Bruno Antonio, Moroni Davide, Martinelli Massimo
Annals of Computer Science and Information Systems
|
2023
|
Vol. 35
889--894
EN
Olive culture is one of the most important for the Mediterranean countries. In recent years, the role of Artificial Intelligence in agriculture is increasing: its use ranges from monitoring of cultivated soil, to irrigation management, to yield prediction, to autonomous agricultural robots, to weed and pest classification and management for example by taking pictures using a standard smartphone or a unmanned aerial vehicle, and all this eases human work and makes it even more accessible. In this work, we propose a method for olive diseases classification, based on an adaptive ensemble of two EfficientNet-b0 models, that improves the state-of-the-art accuracy on a publicly available dataset by 1.6-2.6%. Both in terms of number of parameters and on number of operations, our method reduces complexity roughly by 50% and 80\% respectively, that is a level not seen in at least a decade. Due to its efficiency, this method is also embeddable into a smartphone application for real-time processing.
4
Content available remote Three-way learnability: A learning theoretic perspective on Three-way Decision
Campagner Andrea, Ciucci Davide
Annals of Computer Science and Information Systems
|
2022
|
Vol. 30
243--246
EN
In this article we study the theoretical properties of Three-way Decision (TWD) based Machine Learning, from the perspective of Computational Learning Theory, as a first attempt to bridge the gap between Machine Learning theory and Uncertainty Representation theory. Drawing on the mathematical theory of orthopairs, we provide a generalization of the PAC learning framework to the TWD setting, and we use this framework to prove a generalization of the Fundamental Theorem of Statistical Learning. We then show, by means of our main result, a connection between TWD and selective prediction.
5
Content available remote GaMeDE2 - improved Gap–based Memetic Differential Evolution applied to multi–modal optimisation
Antkiewicz Michał, Myszkowski Paweł B., Laszczyk Maciej
Annals of Computer Science and Information Systems
|
2022
|
Vol. 30
291--300
EN
This paper presents an improved Gap-based Memetic Differential Evolution (GaMeDE2), the modification of the GaMeDE method, which took second place in the GECCO 2020 Competition on Niching Methods for Multi-modal Optimization. GaMeDE2 has reduced complexity, fewer parameters, redefined initialisation, selection operator, and removed processing phases. The method is verified using standard benchmark function sets (classic ones and CEC2013) and a newly proposed benchmark set comprised of deceptive functions. A detailed comparison to state-of-the-art methods (like HVCMO and SDLCSDE) is presented, where the proposed GaMeDE2 outperforms or gives similar results to other methods. The document is concluded by discussing various insights on the problem instances and the methods created as a part of the research.
6
Content available remote A GPU approach to distance geometry in 1D: an implementation in C/CUDA
Hengeveld Simon B., Mucherino A.
Annals of Computer Science and Information Systems
|
2022
|
Vol. 30
333--336
EN
We present a GPU implementation in C and CUDA of a matrix-by-vector procedure that is particularly tailored to a special class of distance geometry problems in dimension 1, which we name “paradoxical DGP instances”. This matrix-by-vector reformulation was proposed in previous studies on an optical processor specialized on this kind of computations. Our computational experiments shows that a large speed-up is observed when comparing our GPU implementation against a standard algorithm for distance geometry, called the Branch-and-Prune algorithm. These results confirm that a suitable implementation of the matrix-by-vector procedure in the context of optic computing is very promising. We also remark, however, that the total number of detected solutions grows with the instance size in our implementations, which appears to be an important limitation to the effective implementation of the optical processor.
7
Content available remote Extended distributive contact lattices and extended contact algebras
Ivanova Tatyana
Annals of Computer Science and Information Systems
|
2020
|
Vol. 21
69--75
EN
The notion of contact algebra is one of the main tools in mereotopology. This paper considers a generalisation of contact algebra (called extended distributive contact lattice) and the so called extended contact algebras which extend the language of contact algebras by the predicates covering and internal connectedness.
8
Content available remote Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap
Ecker K., Tanaś M.
Foundations of Computing and Decision Sciences
|
2007
|
Vol. 32, No. 3
199-212
EN
The coupled tasks scheduling was originally introduced for modelling complex radar devices. It is still used for controlling such devices and applied in similar applications. This paper considers a problem of coupled tasks scheduling on one processor, under the assumptions that all processing times are equal to 1, the gap has an exact even length and the precedence constraints are strict. Although it is proven that the problem stated above is NP-hard in the strong sense if the precedence constraints have a form of a general graph, it is possible to solve some of its relaxed versions in polynomial time. This paper containts a solution for the problem of coupled tasks scheduling with assumption that the precedence constraints graph has a form of chains and it presents an algorithm which can solve the problem with such assumption in time O(n log n).
9
Content available remote Models for dependable computation with multiple inputs and some hardness results
Wang Y., Desmedt Y., Burmester M.
Fundamenta Informaticae
|
2000
|
Vol. 42, Nr 1
61-73
EN
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR graphs to model fault tolerant computations with multiple inputs. While there is a polynomial time algorithm for finding vertex disjoint paths in networks, we will show that the equivalent problem in computation systems with multiple inputs is NP-hard. Our main results are as follows. We present a general model for fault tolerant computation systems with multiple inputs: AND/OR graphs. We show that it is NP-hard to find two vertex disjoint solution graphs in an AND/OR graph. It follows that in the general case redundancy cannot help to achieve survivability, assuming P= NP.
10
Content available remote Teoria złożoności i jej implikacje dla zarządzania organizacjami
Muszyński W.
Management
|
1999
|
Vol. 3, no 2
43-56
PL
Punktem wyjścia dla przedstawionych w pracy koncepcji jest założenie, że organizacje są z systemowego punktu widzenia, złożonymi dynamicznymi systemami nieliniowymi. W rezultacie tego założenia sformułowano i omówiono wybrane zasady i reguły jakie mogą znaleźć zastosowanie w procesach zarządzania organizacjami. Przedstawiono praktyczne zastosowania tych zasad jako ilustrację sukcesu nowych idei w zarządzaniu organizacjami.
EN
The starting point to the concept presented in this paper is the assumption that organizations are nonlinear complex dynami systems. In the result of this assumption selected principles and rules for management have been formulated and discussed. As an illustration of the new management ideas examples of these principles' and rules' applications have been presented.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.