Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 4858
-
Catalog
- Publications 3973 available results
- Journals 60 available results
- Conferences 65 available results
- People 86 available results
- Inventions 1 available results
- Projects 7 available results
- Research Teams 1 available results
- e-Learning Courses 83 available results
- Events 12 available results
- Open Research Data 570 available results
displaying 1000 best results Help
Search results for: GREEDY ALGORITHM
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
On zero-error codes produced by greedy algorithms
PublicationWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
Greedy algorithms for backbone graph coloring in KOALA library
Publication -
Algorithms
Journals -
GREEN CHEMISTRY
Journals -
From grey to green
PublicationThe article presents conceptual project made by students during Urban European Summer School “City on water” in Bremen 2015. The area of study was Hemelingen, Aller-Harbour, Bremen, Germany. The aim was to make a design of regeneration of the area. Students were free in choosing methods and ideas for their project.
-
NUMERICAL ALGORITHMS
Journals -
On the complexity of distributed greedy coloring
PublicationW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.