On approximating the memory-constrained module allocation problem
From MaRDI portal
Recommendations
- A mathematical model and a metaheuristic approach for a memory allocation problem
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- A modular algorithm for resource allocation
- Application of combinatorial methods in the design of memory allocation algorithms
- FPT approximation algorithm for scheduling with memory constraints
- Approximation algorithms for dynamic storage allocation
- An LC branch-and-bound algorithm for the module assignment problem
- Iterative approaches for a dynamic memory allocation problem in embedded systems
- An approximation algorithm for the register allocation problem
- scientific article; zbMATH DE number 4046862
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Assignment of Tasks in a Distributed Processor System with Limited Memory
- Critical Load Factors in Two-Processor Distributed Systems
- One-Half Approximation Algorithms for the k-Partition Problem
- Placement de tâches dans un système distribué et dualité lagrangienne
- The Complexity of Multiterminal Cuts
Cited in
(4)- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- Parameter tuning of continuous Hopfield network applied to combinatorial optimization
- Algorithm for the discrete Weber's problem with an accuracy estimate
- Iterative approaches for a dynamic memory allocation problem in embedded systems
This page was built for publication: On approximating the memory-constrained module allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286996)
