Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Sequential And Parallel Processing In Depth Search Machines

Name: Sequential And Parallel Processing In Depth Search Machines
Brand: World Scientific Publishing Co Pte Ltd
SKU: 05064709
Price: 89.82 EUR
Availability: InStock
Author: Adam Kapralski
ISBN: 9789810217167

Adam Kapralski

Língua

Inglês

Livro Livro de capa dura

Código Libristo: 05064709

Editoras World Scientific Publishing Co Pte Ltd, janeiro 1994

Depth search machines (DSMs) and their applications for processing combinatorial tasks are investiga... Descrição completa

Código Libristo: 05064709

217 b

89.82 €

50% de hipóteses Procuremos no mundo Quando vou receber o meu livro?

Até 30 dias para devoluções

Os clientes também compraram

Give Me Five! 5. Pupil's Book Pack. Wydanie 2023 Donna Shaw|Rob Sved Livro

Livro

17.29 €

Circuitos abiertos Eric Schlaepfer

Adobe ePub DRM

19.92 €

Kicia Kocia i straszna burza Głowińska Anita

Capa mole

2.42 €

Mon cerveau est hyper Assenheim

Capa mole

23.05 €

Lindenstraße, Das 26. Jahr. 26.Jahr, 10 DVDs (Collector's Box, Limited Edition) Marie-Luise Marjan

DVD

66.35 €

Sistemy obespecheniya kachestva vysshego obrazovaniya Nabi Yskak

Capa mole

80.01 €

Cultiver son potager naturel avec Jean-Marie Lespinasse Depierre

Capa mole

32.87 €

Kajika Akira Toriyama

Livro

10.00 €

A nap, amikor a nagymama tönkretette az internetet Marc-Uwe Kling

Livro de capa dura

8.69 €

Invincible 1 Robert Kirkman

Capa mole

25.99 €

La dama del lago Andrzej Sapkowski

Capa mole

34.38 €

Deepwater Horizon, 1 Blu-ray Peter Berg

Blu-ray

16.07 €

Deutschzeit - Östliche Bundesländer und Berlin - 8. Schuljahr Catharina Banneck

Livro de capa dura

30.03 €

Depth search machines (DSMs) and their applications for processing combinatorial tasks are investigated and developed in this book. The combinatorial tasks are understood widely and contain sorting and searching, processing NP-complete and isomorphic complete problems, computational geometry pattern recognition, image analysis and expert reasoning. The main philosophy is to see EXISTENCE and EVERY as the basic tasks, while IDENTIFICATION, SEARCHING and ALL have their own composed structure. In this book, IDENTIFICATION, SEARCHING and ALL algorithms are performed in single and parallel DSMs. It gives models suitable for representing combinatorial problems in order to process them in DSMS. The given approach should enable low computational complexity for many practical algorithms to be reached, which is theoretically quite unexpected so long the classic approach is considered.