Designing screen layout in multimedia applications through integer programming and metaheuristic
نویسندگان
چکیده
Binding audiovisual content into multimedia applications requires the specification of each media item, including its size and position, to define a screen layout. The application author must plan application’s layout (ASL), considering variety sizes where shall be executed. An ASL that maximizes area occupied by items on is essential, given space valuable asset for broadcasters. In this paper, we introduce Application Screen Layout Optimization Problem, present NP-hardness. Besides, two integer programming formulations an Iterated Local Search (ILS) metaheuristic are proposed solve it. efficiency methods evaluated, showing achieves better results at least 12 times faster, average, than mathematical formulations. Also, approaches were compared design algorithm, their effectiveness.
منابع مشابه
Designing Self-adaptive Multimedia Applications Through Hierarchical Reconfiguration
Distributed multimedia applications are very sensitive to resource variations. An attractive way for dealing with dynamic resource variations consists in making applications adaptive, and even self-adaptive. The objective is to grant applications the ability to observe themselves and their environment, to detect significant changes and to adjust their behavior accordingly. This issue has been t...
متن کاملAdvanced Data Layout Optimization for Multimedia Applications
Increasing disparity between processor and memory speeds has been a motivation for designing systems with deep memory hierarchies. Most data-dominated multimedia applications do not use their cache e ciently and spend much of their time waiting for memory accesses [1]. This also implies a signi cant additional cost in increased memory bandwidth, in the system bus load and the associated power c...
متن کاملMixed Integer Nonlinear Programming Applications
In this contribution we apply different approaches to solve four rather different MINLP problems: special extensions to time-indexed formulations of production planning problems, a production planning problem in BASF’s petrochemical division, a site analysis of one of BASF’s bigger sites, and a process design problem. The first problem is related to a useful nonlinear extension of production pl...
متن کاملAutomatic Data Layout Using 0-1 Integer Programming
In the optimization world now, even the use of considering the number of processors for parallel programming is carefully considered. The goal of high-level languages is to provide a simple yet efficient machine-independent parallel programming model. The programmer’s data parallel programs should be able to compile and executed with a good performance on many different architectures. However t...
متن کاملCombinatorial n-fold Integer Programming and Applications
Integer Linear Programming is a famous NP-complete problem. Lenstra showed that in the case of small dimension, it can be solved in polynomial time. This algorithm became a ubiquitous tool, especially in the design of parameterized algorithms for NP-complete problems, where we wish to isolate the hardness of an instance to some parameter. However, it was discovered that in many cases using Lens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2021160