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

0.8 LCD A4 Mini Portable USB Documents Scanner - Silver (2 x AA) bl rs 0002 randoseru for girls and boys school bag japanese bag fits for a4 file 1 pcs raincover yellow color page 1 page 3 page 4
Color: Silver - Material: ABS + aluminum alloy - Capture important documents letters photos etc - Maximum scanning speed for A4 size document - Image sensor: A4 Color Contact Image Sensor - Resolution: Low 300 600 900 dpi - Max scan length: A4 (216mm) - Directly store in Micro SD / TF card - File format: JPEG / PDF - 0.8" LCD: Scanning status display - Scanning speed: Color: 13s/pag (high resolution); 3s/page (low resolution)/ Black and white: 6s/page (high resolution); 2s/page (low resolution) - Interface: USB 2.0 high speed port - External memory: Micro SD/TF card (MAX.32GB) - Operating system: Windows 2000 / ME / XP / Mac OS - Powered by 2 x AA batteries (not included) - Package included: - 1 x Scanner - 1 x USB 2.0 cable (71cm) - 1 x Software CD - 1 x Cleaning cloth - 1 x English user manual
3263.36 руб.
Algorithms on the Book Crossing Number Problem of Graphs bl rs 0002 randoseru for girls and boys school bag japanese bag fits for a4 file 1 pcs raincover yellow color page 1 page 3 page 4
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 руб.