the proceedings contain 73 papers. the special focus in this conference is on combinatorialoptimization and Applications. the topics include: Improved Scheduling with a Shared Resource;an Energy-Efficient S...
ISBN:
(纸本)9783031496134
the proceedings contain 73 papers. the special focus in this conference is on combinatorialoptimization and Applications. the topics include: Improved Scheduling with a Shared Resource;an Energy-Efficient Scheduling Method for Real-Time Multi-workflow in Container Cloud;weakly Nondominated Solutions of Set-Valued optimization Problems with Variable Ordering Structures in Linear Spaces;the MaxIS-Shapley Value in Perfect Graphs;asteroidal Sets and Dominating Paths;a Novel Approximation Algorithm for Max-Covering Circle Problem;GAMA: Genetic Algorithm for k-Coverage and Connectivity with Minimum Sensor Activation in Wireless Sensor Networks;simple Heuristics for the Rooted Max Tree Coverage Problem;efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint;algorithms on a Path Covering Problem with Applications in Transportation;data Summarization Beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization;greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization;improved Lower Bound for Estimating the Number of Defective Items;popularity on the Roommate Diversity Problem;on Half Guarding Polygons;dynamic programming for the Fixed Route Hybrid Electric Aircraft Charging Problem;algorithms for the Ridesharing with Profit Constraint Problem;multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms;maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs;the Line-Constrained Maximum Coverage Facility Location Problem;faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges;on Connectedness of Solutions to integer Linear Systems;an Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem;the Longest Subsequence-Repeated Subsequence Problem;an Approximation Algorithm for Covering Vertices by 4+ -Paths;V-Words, Lyndon Words and Substring circ-UMFFs;the Two-Center
In the past years, the issues of energy efficiency and interference are becoming increasingly serious in wireless local area network (WLAN) since lots of access points (AP) are deployed densely to provide high-speed u...
详细信息
ISBN:
(纸本)9783030061616;9783030061609
In the past years, the issues of energy efficiency and interference are becoming increasingly serious in wireless local area network (WLAN) since lots of access points (AP) are deployed densely to provide high-speed users access. However, current works focus on solving the two issues separately and the influence of each other is rarely considered. To address these problems, we propose a joint optimization scheme of energy efficiency and interference to reduce energy consumption and interference together without sacrificing users' traffic demands. Firstly, based on energy consumption measurement of AP and network interference analysis, we establish energy efficiency and interference models respectively. then, the weighting method is introduced to build the joint optimization to quantify the effects of user-AP association, AP switch, AP transmit power and AP channel on energy consumption and interference. Lastly, we formulate the joint optimization as an Mixed integer Non-Linear programming (MINLP) problem. Since the MINLP problem is NP-hard, we proposed an Joint optimization of Energy Efficiency and Interference (JOEI) algorithm based on greedy method to simplify its computational complexity. the evaluation results show that the proposed algorithm can effectively reduce the network energy consumption while improve the capacity of WLANs.
A convex triangular grid is a planar digraph G embedded in the plane so that each bounded face is an equilateral triangle withthree edges and their union R forms a convex polygon. A function h: E(G) → is called a co...
详细信息
the proceedings contain 25 papers. the special focus in this conference is on ATSE 2015 and HOFM 2015. the topics include: Learning-based testing of distributed microservice architectures;the synergy between user expe...
ISBN:
(纸本)9783662492239
the proceedings contain 25 papers. the special focus in this conference is on ATSE 2015 and HOFM 2015. the topics include: Learning-based testing of distributed microservice architectures;the synergy between user experience design and software testing;combining time and concurrency in model-based statistical testing of embedded real-time systems;towards supporting agile combinatorial test design;behavioral types for component-based development of cyber-physical systems;refactoring proofs with tactician;exploring the role of logic and formal methods in information systems education;type-based enforcement of programming guidelines;clustering formulation using constraint optimization;towards a boosted route planner using individual mobility models;design of a business-to-government information sharing architecture using business rules;beyond the domain of business process management;on integrating social and sensor networks for emergency management;quantitative modelling of residential smart grids;attributed probabilistic p systems and their application to the modelling of social interactions in primates;probabilistic modelling and analysis of a fish population;a tool for the modelling and simulation of ecological systems based on grid systems;distributed coordinated adaptation of cloud-based applications;fuzzy description logics for component selection in software design;towards adapting choreography-based service compositions through enterprise integration patterns;an experimental evaluation on runtime verification of self-adaptive systems in the presence of uncertain transition probabilities;towards automatic decision support for bike-sharing system design and automated synthesis of protocol converters with BALM-II.
the proceedings contain 84 papers. the special focus in this conference is on Principles and Practice of Constraint programming. the topics include: Hybrid benders decomposition algorithms in constraint logic programm...
ISBN:
(纸本)3540428631
the proceedings contain 84 papers. the special focus in this conference is on Principles and Practice of Constraint programming. the topics include: Hybrid benders decomposition algorithms in constraint logic programming;a hybrid framework integrating mixed integerprogramming and constraint logic programming;towards stochastic constraint programming;global cut framework for removing symmetries;capturing structure with satisfiability;phase transitions and backbones of 3-sat and maximum 3-sat;solving non-binary CSPS using the hidden variable encoding;a filtering algorithm for the stretch constraint;network flow problems in constraint programming;pruning for the minimum constraint family and for the number of distinct values constraint family;components for state restoration in tree search;constraint-based verification of client-server protocols;lower bounds for non-binary constraint optimization problems;a general scheme for multiple lower bound computation in constraint optimization;solving disjunctive constraints for interactive graphical applications;non-overlapping constraints between convex polytopes;formal models of heavy-tailed behavior in combinatorial search;in search of a phase transition in the ac-matching problem;a CLP approach to the protein side-chain placement problem;solving constraints over floating-point numbers;optimal pruning in parametric differential equations;an efficient filtering technique combining domain partition and arc consistency;the expressive power of binary linear programming;the traveling tournament problem description and benchmarks;structural constraint-based modeling and reasoning with basic configuration cells;solving Boolean satisfiability using local search guided by unit clause elimination and fast optimal instruction scheduling for single-issue processors with arbitrary latencies.
We address two two-dimensional bin packing problems where the bins are rectangular and have the same size. the items are also rectangular and all of them must be packed withthe objective of minimizing the number of b...
详细信息
the minimum-cost multicommodity flow problem involves simultaneously shipping multiple commodities through a single network so that the total flow obeys arc capacity constraints and has minimum cost. Multicommodity fl...
详细信息
Production scheduling has always been an important topic in smart manufacturing especially integrated with dispatching and routing of automatic guided vehicle or autonomous mobile robots, which is generally modeled as...
详细信息
ISBN:
(纸本)9798350354416;9798350354409
Production scheduling has always been an important topic in smart manufacturing especially integrated with dispatching and routing of automatic guided vehicle or autonomous mobile robots, which is generally modeled as a nondeterministic polynomial-hard integerprogramming problem. However, most existing studies solve this combinatorialoptimization problem through decomposition, namely dealing with scheduling and routing separately, or just assuming a fixed predefined distance matrix for routing, which sacrifices the solution quality for shorter time of decision making. As for metaheuristic solution for such integrated models, the need for effective and efficient searching rules is urgent, so that the heuristics can be more fit for specific purpose and scenarios. thus, in this paper, an integrated scheduling and routing model is proposed oriented towards the optimization of production scheduling and fleet management in smart manufacturing environment. A genetic algorithm (GA) is used to solve this problem based on incremental planning (IP) strategy which makes effect through ensemble of two local search operators considering the time windows and alternative paths for every transportation task of AGVs. the effectiveness of the proposed method is validated through a simulation case study with horizontal comparison. Results showed that the IP strategy can improve the solution quality and traffic load imbalance of the factory layout, by reducing the makespan and working time of AGV by about 11.5% and 9% respectively. About 80% of the tasks obtained a shorter makespan by adopting an alternative path, showing the ability of traffic load balancing among layout elements when the problem scale increases.
integer Linear programming (ILP) has been proposed as a formalism for encoding precise structural and semantic constraints for Natural Language Inference (NLI). However, traditional ILP frameworks are non-differentiab...
详细信息
the paper deals with low-power adaptive scheduling of synchronous and flexible real-time OS tasks. A software reconfiguration scenario is assumed to be any run-time operation allowing the addition-removal-update of OS...
详细信息
ISBN:
(纸本)9789897580390
the paper deals with low-power adaptive scheduling of synchronous and flexible real-time OS tasks. A software reconfiguration scenario is assumed to be any run-time operation allowing the addition-removal-update of OS tasks to adapt the system to its environment under well-defined conditions. the problem is that any reconfiguration can push the system to an unfeasible behavior where temporal properties are violated or the energy consumption is possibly high and unacceptable. A task in the system can change its characteristics at any time when a reconfiguration scenario is applied, it can also be stopped or replaced by another one. the difficulty is how to find the new temporal parameters of the systems tasks after any reconfiguration. We use a DVS processor which is with a variable speed to support run-time solutions that re-obtain the system's feasibility. the challenge is how to compute the best combinations between available processor speeds for a good compromise between execution time and energy consumption. We propose a combinatorialoptimization method based on integerprogramming and heuristics. We propose also a solution when the available speeds do not allow the feasibility of the system. Both approaches include a mechanism to adjust the deadlines of tasks to satisfy the feasibility conditions and overcome the problem of rejected tasks. this mechanism makes the scheduling more flexible and able to react in accordance with its environment.
暂无评论