Parallel interval-Newton using message passing dynamic load balancing strategies

Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of the 2001 ACM/IEEE Conference on Supercomputing s. 23
Hlavní autoři:	Gau, Chao-Yang, Stadtherr, Mark A.
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 10.11.2001
Edice:	ACM Conferences
Témata:	Computing methodologies > Artificial intelligence > Search methodologies Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search Computing methodologies > Artificial intelligence > Search methodologies > Game tree search Mathematics of computing > Mathematical analysis > Functional analysis > Approximation Mathematics of computing > Mathematical analysis > Mathematical optimization Mathematics of computing > Mathematical analysis > Nonlinear equations Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis Theory of computation > Design and analysis of algorithms > Mathematical optimization nonlinear equations branch-and-bound interval analysis parallel computing branch-and-prune global optimization
ISBN:	9781581132939, 158113293X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!