Nagging: A scalable fault-tolerant paradigm for distributed search

DOI10.1016/S0004-3702(02)00228-XzbMath0999.68048MaRDI QIDQ1614863

Sean Forman, Andrew Wildenberg, Giovanni Resta, Alberto Maria Segre

Publication date: 9 September 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

branch and boundBoolean satisfiabilitygame tree searchparallel/distributed search algorithmssearch pruning

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (1)

An optimal multiprocessor combinatorial auction solver

Uses Software

• TSPLIB
• PVM
• MPI/MPICH
• DIMACS
• Globus Toolkit
• SPLIDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A high-performance, portable implementation of the MPI message passing interface standard
• On the solution of traveling salesman problems
• An analysis of alpha-beta pruning
• The traveling salesman. Computational solutions for RSP applications
• Nagging: A distributed, adversarial search-pruning technique applied to first-order inference
• APHID: Asynchronous parallel game-tree search
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Generating hard satisfiability problems
• Anomalies in parallel branch-and-bound algorithms
• Parallel Search Algorithms for Discrete Optimization Problems
• State-Space Search
• A novel asynchronous parallelism scheme for first-order logic
• Branch-and-Bound Methods: A Survey
• A machine program for theorem-proving
• The complexity of theorem-proving procedures

This page was built for publication: Nagging: A scalable fault-tolerant paradigm for distributed search