Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nagging: A scalable fault-tolerant paradigm for distributed search |
scientific article; zbMATH DE number 1797850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nagging: A scalable fault-tolerant paradigm for distributed search |
scientific article; zbMATH DE number 1797850 |
Statements
Nagging: A scalable fault-tolerant paradigm for distributed search (English)
0 references
9 September 2002
0 references
parallel/distributed search algorithms
0 references
search pruning
0 references
game tree search
0 references
branch and bound
0 references
Boolean satisfiability
0 references
0 references
0 references
0 references
0.8395548
0 references
0 references
0.8227991
0 references
