Pages that link to "Item:Q3735072"
From MaRDI portal
The following pages link to Allocating programs containing branches and loops within a multiple processor system (Q3735072):
Displaying 11 items.
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
- Partitioning multiple-chain-like task across a host-satellite system (Q1313732) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- Complexity analysis of new task allocation problem using network flow method on multicore clusters (Q1719030) (← links)
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems (Q1904611) (← links)
- AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION (Q4820007) (← links)
- Task assignment in distributed systems using network flow methods (Q6567698) (← links)
