Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: on-line algorithm

Sortuj według:

Ogranicz wyniki do:

An algorithm for 1-space bounded cube packing

Zielonka Łukasz

Annals of Computer Science and Information Systems

2019

Vol. 18

171--175

In this paper, we present a 1-space bounded cube packing algorithm with asymptotic competitive ratio 10.872.

A survey of hard-to-color graphs for off-line and on-line model of vertex coloring

Borowiecki P., Kubale M.

Journal of Applied Computer Science

2001

Vol. 9, nr 2

7-17

In the paper we review the most popular on-line and off-line graph coloring algorithms. For each algorithm we give: short description. performance guarantee, the smallest HC and slightly HC graphs, positive cases and negative cases. Finally, we give the smallest benchmark for off-line sequential algorithms and the smallest weak benchmark for on-line algorithms.

On-line adaptive learning rate BP algorithm for MLP and application to an identification problem

Sha D. H., Bajić V. B.

Journal of Applied Computer Science

1999

Vol. 7, nr 2

67-82

An on-line algorithm that uses an adaptive learning rate is proposed. Its development is based on the analysis of the convergence of the conventional gradient descent method for three-layer BP neural networks. The effectiveness of the proposed algorithm applied to the identification and prediction of behavior of non-linear dynamic systems is demonstrated by simulation experiments.