Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Optimizing The Replication Of Multi-Quality Web Applications Using Aco And Wolf, Judson C. Dressler
Optimizing The Replication Of Multi-Quality Web Applications Using Aco And Wolf, Judson C. Dressler
Theses and Dissertations
This thesis presents the adaptation of Ant Colony Optimization to a new NP-hard problem involving the replication of multi-quality database-driven web applications (DAs) by a large application service provider (ASP). The ASP must assign DA replicas to its network of heterogeneous servers so that user demand is satisfied and replica update loads are minimized. The algorithm proposed, AntDA, for solving this problem is novel in several respects: ants traverse a bipartite graph in both directions as they construct solutions, pheromone is used for traversing from one side of the bipartite graph to the other and back again, heuristic edge values …
No Free Lunch, Bayesian Inference, And Utility: A Decision-Theoretic Approach To Optimization, Christopher Kenneth Monson
No Free Lunch, Bayesian Inference, And Utility: A Decision-Theoretic Approach To Optimization, Christopher Kenneth Monson
Theses and Dissertations
Existing approaches to continuous optimization are essentially mechanisms for deciding which locations should be sampled in order to obtain information about a target function's global optimum. These methods, while often effective in particular domains, generally base their decisions on heuristics developed in consideration of ill-defined desiderata rather than on explicitly defined goals or models of the available information that may be used to achieve them. The problem of numerical optimization is essentially one of deciding what information to gather, then using that information to infer the location of the global optimum. That being the case, it makes sense to model …