Pages that link to "Item:Q2631232"
From MaRDI portal
The following pages link to Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232):
Displaying 12 items.
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- A parallel evolutionary algorithm to optimize dynamic memory managers in embedded systems (Q609096) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems (Q1687632) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
- Iterative approaches for a dynamic memory allocation problem in embedded systems (Q2356204) (← links)
- Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research (Q4609783) (← links)
- A new variable neighborhood search approach for solving dynamic memory allocation problem (Q4987788) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
