5,529 research outputs found
A Tutorial on Clique Problems in Communications and Signal Processing
Since its first use by Euler on the problem of the seven bridges of
K\"onigsberg, graph theory has shown excellent abilities in solving and
unveiling the properties of multiple discrete optimization problems. The study
of the structure of some integer programs reveals equivalence with graph theory
problems making a large body of the literature readily available for solving
and characterizing the complexity of these problems. This tutorial presents a
framework for utilizing a particular graph theory problem, known as the clique
problem, for solving communications and signal processing problems. In
particular, the paper aims to illustrate the structural properties of integer
programs that can be formulated as clique problems through multiple examples in
communications and signal processing. To that end, the first part of the
tutorial provides various optimal and heuristic solutions for the maximum
clique, maximum weight clique, and -clique problems. The tutorial, further,
illustrates the use of the clique formulation through numerous contemporary
examples in communications and signal processing, mainly in maximum access for
non-orthogonal multiple access networks, throughput maximization using index
and instantly decodable network coding, collision-free radio frequency
identification networks, and resource allocation in cloud-radio access
networks. Finally, the tutorial sheds light on the recent advances of such
applications, and provides technical insights on ways of dealing with mixed
discrete-continuous optimization problems
ASlib: A Benchmark Library for Algorithm Selection
The task of algorithm selection involves choosing an algorithm from a set of
algorithms on a per-instance basis in order to exploit the varying performance
of algorithms over a set of instances. The algorithm selection problem is
attracting increasing attention from researchers and practitioners in AI. Years
of fruitful applications in a number of domains have resulted in a large amount
of data, but the community lacks a standard format or repository for this data.
This situation makes it difficult to share and compare different approaches
effectively, as is done in other, more established fields. It also
unnecessarily hinders new researchers who want to work in this area. To address
this problem, we introduce a standardized format for representing algorithm
selection scenarios and a repository that contains a growing number of data
sets from the literature. Our format has been designed to be able to express a
wide variety of different scenarios. Demonstrating the breadth and power of our
platform, we describe a set of example experiments that build and evaluate
algorithm selection models through a common interface. The results display the
potential of algorithm selection to achieve significant performance
improvements across a broad range of problems and algorithms.Comment: Accepted to be published in Artificial Intelligence Journa
Recommended from our members
Automated generation of computationally hard feature models using evolutionary algorithms
This is the post-print version of the final paper published in Expert Systems with Applications. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2014 Elsevier B.V.A feature model is a compact representation of the products of a software product line. The automated extraction of information from feature models is a thriving topic involving numerous analysis operations, techniques and tools. Performance evaluations in this domain mainly rely on the use of random feature models. However, these only provide a rough idea of the behaviour of the tools with average problems and are not sufficient to reveal their real strengths and weaknesses. In this article, we propose to model the problem of finding computationally hard feature models as an optimization problem and we solve it using a novel evolutionary algorithm for optimized feature models (ETHOM). Given a tool and an analysis operation, ETHOM generates input models of a predefined size maximizing aspects such as the execution time or the memory consumption of the tool when performing the operation over the model. This allows users and developers to know the performance of tools in pessimistic cases providing a better idea of their real power and revealing performance bugs. Experiments using ETHOM on a number of analyses and tools have successfully identified models producing much longer executions times and higher memory consumption than those obtained with random models of identical or even larger size.European Commission (FEDER), the Spanish Government and
the Andalusian Government
Applying autonomy to distributed satellite systems: Trends, challenges, and future prospects
While monolithic satellite missions still pose significant advantages in terms of accuracy and
operations, novel distributed architectures are promising improved flexibility, responsiveness,
and adaptability to structural and functional changes. Large satellite swarms, opportunistic satellite
networks or heterogeneous constellations hybridizing small-spacecraft nodes with highperformance
satellites are becoming feasible and advantageous alternatives requiring the adoption
of new operation paradigms that enhance their autonomy. While autonomy is a notion that
is gaining acceptance in monolithic satellite missions, it can also be deemed an integral characteristic
in Distributed Satellite Systems (DSS). In this context, this paper focuses on the motivations
for system-level autonomy in DSS and justifies its need as an enabler of system qualities. Autonomy
is also presented as a necessary feature to bring new distributed Earth observation functions
(which require coordination and collaboration mechanisms) and to allow for novel structural
functions (e.g., opportunistic coalitions, exchange of resources, or in-orbit data services). Mission
Planning and Scheduling (MPS) frameworks are then presented as a key component to implement
autonomous operations in satellite missions. An exhaustive knowledge classification explores the
design aspects of MPS for DSS, and conceptually groups them into: components and organizational
paradigms; problem modeling and representation; optimization techniques and metaheuristics;
execution and runtime characteristics and the notions of tasks, resources, and constraints.
This paper concludes by proposing future strands of work devoted to study the trade-offs of
autonomy in large-scale, highly dynamic and heterogeneous networks through frameworks that
consider some of the limitations of small spacecraft technologies.Postprint (author's final draft
- …