17,360 research outputs found
On complexity of optimized crossover for binary representations
We consider the computational complexity of producing the best possible
offspring in a crossover, given two solutions of the parents. The crossover
operators are studied on the class of Boolean linear programming problems,
where the Boolean vector of variables is used as the solution representation.
By means of efficient reductions of the optimized gene transmitting crossover
problems (OGTC) we show the polynomial solvability of the OGTC for the maximum
weight set packing problem, the minimum weight set partition problem and for
one of the versions of the simple plant location problem. We study a connection
between the OGTC for linear Boolean programming problem and the maximum weight
independent set problem on 2-colorable hypergraph and prove the NP-hardness of
several special cases of the OGTC problem in Boolean linear programming.Comment: Dagstuhl Seminar 06061 "Theory of Evolutionary Algorithms", 200
Context-driven progressive enhancement of mobile web applications: a multicriteria decision-making approach
Personal computing has become all about mobile and embedded devices. As a result, the adoption rate of smartphones is rapidly increasing and this trend has set a need for mobile applications to be available at anytime, anywhere and on any device. Despite the obvious advantages of such immersive mobile applications, software developers are increasingly facing the challenges related to device fragmentation. Current application development solutions are insufficiently prepared for handling the enormous variety of software platforms and hardware characteristics covering the mobile eco-system. As a result, maintaining a viable balance between development costs and market coverage has turned out to be a challenging issue when developing mobile applications. This article proposes a context-aware software platform for the development and delivery of self-adaptive mobile applications over the Web. An adaptive application composition approach is introduced, capable of autonomously bypassing context-related fragmentation issues. This goal is achieved by incorporating and validating the concept of fine-grained progressive application enhancements based on a multicriteria decision-making strategy
Telecommunications Network Planning and Maintenance
Telecommunications network operators are on a constant challenge to provide new services which require ubiquitous broadband access. In an attempt to do so, they are faced with many problems such as the network coverage or providing the guaranteed Quality of Service (QoS). Network planning is a multi-objective optimization problem which involves clustering the area of interest by minimizing a cost function which includes relevant parameters, such as installation cost, distance between user and base station, supported traffic, quality of received signal, etc. On the other hand, service assurance deals with the disorders that occur in hardware or software of the managed network. This paper presents a large number of multicriteria techniques that have been developed to deal with different kinds of problems regarding network planning and service assurance. The state of the art presented will help the reader to develop a broader understanding of the problems in the domain
Reversible Pebbling Game for Quantum Memory Management
Quantum memory management is becoming a pressing problem, especially given
the recent research effort to develop new and more complex quantum algorithms.
The only existing automatic method for quantum states clean-up relies on the
availability of many extra resources. In this work, we propose an automatic
tool for quantum memory management. We show how this problem exactly matches
the reversible pebbling game. Based on that, we develop a SAT-based algorithm
that returns a valid clean-up strategy, taking the limitations of the quantum
hardware into account. The developed tool empowers the designer with the
flexibility required to explore the trade-off between memory resources and
number of operations. We present three show-cases to prove the validity of our
approach. First, we apply the algorithm to straight-line programs, widely used
in cryptographic applications. Second, we perform a comparison with the
existing approach, showing an average improvement of 52.77%. Finally, we show
the advantage of using the tool when synthesizing a quantum circuit on a
constrained near-term quantum device.Comment: In Proc. Design Automation and Test in Europe (DATE 2019
- …