Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 18701
-
Catalog
- Publications 12516 available results
- Journals 552 available results
- Conferences 259 available results
- Publishing Houses 1 available results
- People 510 available results
- Inventions 32 available results
- Projects 125 available results
- Laboratories 14 available results
- Research Teams 41 available results
- Research Equipment 15 available results
- e-Learning Courses 1385 available results
- Events 60 available results
- Open Research Data 3191 available results
displaying 1000 best results Help
Search results for: EXCITABLE SYSTEMS
-
CYBERNETICS AND SYSTEMS
Journals -
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
TELECOMMUNICATION SYSTEMS
Journals -
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Equitable vertex coloring of graphs
PublicationW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Green and equitable analytical chemistry
PublicationGreen analytical chemistry introduces the ideas of reduction ofanalytical activities impact on the environment. However, to bemore sustainable, analytical chemistry should include socialaspects in greater manner. In this light‘equitable’analyticalprocedures, which are easily available in terms of price andapplicability by everyday user, are developed. These positivetrends are observed as many procedures, based on commonlyused for...
-
Zdzisław Kowalczuk prof. dr hab. inż.
PeopleZdzislaw Kowalczuk received his M.Sc. degree in 1978 and Ph.D. degree in 1986, both in Automatic Control from Technical University of Gdańsk (TUG), Gdańsk, Poland. In 1993 he received his D.Sc. degree (Dr Habilitus) in Automatic Control from Silesian Technical University, Gliwice, Poland, and the title of Professor from the President of Poland in 2003. Since 1978 he has been with Faculty of Electronics, Telecommunications and Informatics...
-
A system automating repairs of IT systems
PublicationThis paper presents two problems that are important nowadays: the problem of IT systems monitoring and the problem of repairing them. It shows the developed solution, aimed to automate the existing industrial repair process and to integrate it with the existing monitoring solutions and mechanisms. Described solution is a part of a bigger whole, called the Repair Management Framework (RMF). This paper presents also briefly a case...
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.