Pages that link to "Item:Q4311641"
From MaRDI portal
The following pages link to Branch-and-bound and backtrack search on mesh-connected arrays of processors (Q4311641):
Displayed 6 items.
- Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks (Q666208) (← links)
- Towards optimal locality in mesh-indexings (Q1348392) (← links)
- Scheduling task-trees with additive scales on parallel/distributed machines (Q1391320) (← links)
- Analysis of randomized load distribution for reproduction trees in linear arrays and rings (Q1885897) (← links)
- DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES (Q5249013) (← links)
- Deterministic parallel backtrack search (Q5958310) (← links)