Новые поступления

Постельное белье Tango Постельное белье Page (1,5 спал.) for hp 4100 feed roll wheel page 3 href page 5
Производитель: Tango Материал: Хлопковый сатин Состав: 100% хлопок Размер: Полутороспальное Размер пододеяльника: 160х210 см Тип застежки: Кнопки Размер простыни: 180х245 (обычная) Размер наволочек: 50х70 и 70х70 (по 1 шт) Упаковка комплекта: Подарочная коробка Страна бренда: Китай
3530 руб.
Full Page Magnifying Sheet Fresnel Lens 3X Magnification PVC Magnifier for hp 4100 feed roll wheel page 3 href page 5
Description Full Page Magnifying Sheet Fresnel Lens 3X Magnification Magnifier Specifications Material: Optical PVC Magnification: 3x Dimension: (approx.) 245*170mm Enlarged Area: (approx.) 245*170mm Features Large full page fresnel magnifying sheet. This is a flexible plastic sheet which plays a part of a large magnifying glass. Ideal visual aid for viewing large areas of text, photos and maps. Very useful to keep in car with a road atlas. Handy, lightweight, bendable and practical. Note Please allow a bit measuring error. Package included 1 x Full Page Magnifying Sheet
2.29 руб.
Algorithms on the Book Crossing Number Problem of Graphs for hp 4100 feed roll wheel page 3 href page 5
After reviewing recent research in Graph Drawings, in this book, author investigated: 1) Novel heuristic algorithms to solve the 1-page and 2-page BCNPs. They obtained the results better than or comparable with existing algorithms. 2) Genetic algorithms for the BCNPs. They obtained better results than the latest heuristic algorithms. 3) Two neural network models for the 1-page and 2-page BCNPs, respectively, and the convergence of the neural network models. Both models obtained good results. Especially, the model for the 2-page BCNP achieved much better performance than the existing model. 4) The complexity of parallel genetic algorithms, and the unified framework of PGA models in the form of function PGA (subpopulation size, cluster size, migration period, topology). 5) Theorems about the 1-page and 2-page BCNs for some kinds of structural graphs. 6) Proximity to the optimal crossing numbers for the evaluation of different algorithms on some kinds of structural graphs, and conjectures of 1-page and 2-page BCNs for some kinds of structural graphs.
4829 руб.