Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 10,74
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 18,75
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 17,82
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 24,23
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 22,48
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Gyan Books Pvt. Ltd., Delhi, India
EUR 22,33
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carrito
Librería: Forgotten Books, London, Reino Unido
EUR 15,22
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. Print on Demand. This book presents two novel algorithms for calculating the combined area of a group of circles on a two-dimensional plane. The first algorithm, deterministic in nature, has an algorithmic complexity of 0(n2), where n denotes the number of circles. The second algorithm is probabilistic, with a complexity of o(n), making it more efficient for larger sets of circles. The author employs recent developments in the field of reliability estimation to establish the fast convergence of the probabilistic method and extends the algorithm to calculate the volume of n-dimensional spheres with complexity 0(nk). The author situates this work within the broader discourse on estimating the area of unions of geometric shapes, providing a valuable resource for researchers and practitioners in computer science and related fields. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.