3,478 research outputs found
Search based software engineering: Trends, techniques and applications
© ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version is available from the link below.In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives.
This article provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.EPSRC and E
Q-Strategy: A Bidding Strategy for Market-Based Allocation of Grid Services
The application of autonomous agents by the provisioning and usage of computational services is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic service provisioning and usage of Grid services, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems.
The contributions of the paper are threefold. First, we present a bidding agent framework for implementing artificial bidding agents, supporting consumers and providers in technical and economic preference elicitation as well as automated bid generation by the requesting and provisioning of Grid services. Secondly, we introduce a novel consumer-side bidding strategy, which enables a goal-oriented and strategic behavior by the generation and submission of consumer service requests and selection of provider offers. Thirdly, we evaluate and compare the Q-strategy, implemented within the presented framework, against the Truth-Telling bidding strategy in three mechanisms – a centralized CDA, a decentralized on-line machine scheduling and a FIFO-scheduling mechanisms
Rational bidding using reinforcement learning: an application in automated resource allocation
The application of autonomous agents by the provisioning and usage of computational resources is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic resource provisioning and usage of computational resources, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems.
The contributions of the paper are threefold. First, we present a framework for supporting consumers and providers in technical and economic preference elicitation and the generation of bids. Secondly, we introduce a consumer-side reinforcement learning bidding strategy which enables rational behavior by the generation and selection of bids. Thirdly, we evaluate and compare this bidding strategy against a truth-telling bidding strategy for two kinds of market mechanisms – one centralized and one decentralized
Hierarchical Multi-Agent Optimization for Resource Allocation in Cloud Computing
In cloud computing, an important concern is to allocate the available
resources of service nodes to the requested tasks on demand and to make the
objective function optimum, i.e., maximizing resource utilization, payoffs and
available bandwidth. This paper proposes a hierarchical multi-agent
optimization (HMAO) algorithm in order to maximize the resource utilization and
make the bandwidth cost minimum for cloud computing. The proposed HMAO
algorithm is a combination of the genetic algorithm (GA) and the multi-agent
optimization (MAO) algorithm. With maximizing the resource utilization, an
improved GA is implemented to find a set of service nodes that are used to
deploy the requested tasks. A decentralized-based MAO algorithm is presented to
minimize the bandwidth cost. We study the effect of key parameters of the HMAO
algorithm by the Taguchi method and evaluate the performance results. When
compared with genetic algorithm (GA) and fast elitist non-dominated sorting
genetic (NSGA-II) algorithm, the simulation results demonstrate that the HMAO
algorithm is more effective than the existing solutions to solve the problem of
resource allocation with a large number of the requested tasks. Furthermore, we
provide the performance comparison of the HMAO algorithm with the first-fit
greedy approach in on-line resource allocation
- …