Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimizing Personal Computer Configurationswith Heuristic-Based Search Methods

Optimizing Personal Computer Configurationswith Heuristic-Based Search Methods Given the diversity and limitedcompatibility for personal computer hardware,obtaining an (sub-)optimal configuration fordifferent usage restricted to some budgetlimits and other possible criteria can bechallenging. In this paper, we firstlyformulated these common configuration problemsas discrete optimization problems to flexiblyadd in or modify users' requirements. Moreinterestingly, we proposed two intelligentoptimizers: a simple-yet-powerful beam searchmethod and a min-conflict heuristic-basedmicro-genetic algorithm (MGA) to solve thisreal-life optimization problem. Theheuristic-based MGA consistently outperformedthe beam search and branch-and-bound method inmost test cases. Furthermore, our work opens upexciting directions for investigation. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Artificial Intelligence Review Springer Journals

Optimizing Personal Computer Configurationswith Heuristic-Based Search Methods

Artificial Intelligence Review , Volume 17 (2) – Oct 10, 2004

Loading next page...
 
/lp/springer-journals/optimizing-personal-computer-configurationswith-heuristic-based-search-k9yjLqegh7

References (16)

Publisher
Springer Journals
Copyright
Copyright © 2002 by Kluwer Academic Publishers
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Computer Science, general
ISSN
0269-2821
eISSN
1573-7462
DOI
10.1023/A:1014587626020
Publisher site
See Article on Publisher Site

Abstract

Given the diversity and limitedcompatibility for personal computer hardware,obtaining an (sub-)optimal configuration fordifferent usage restricted to some budgetlimits and other possible criteria can bechallenging. In this paper, we firstlyformulated these common configuration problemsas discrete optimization problems to flexiblyadd in or modify users' requirements. Moreinterestingly, we proposed two intelligentoptimizers: a simple-yet-powerful beam searchmethod and a min-conflict heuristic-basedmicro-genetic algorithm (MGA) to solve thisreal-life optimization problem. Theheuristic-based MGA consistently outperformedthe beam search and branch-and-bound method inmost test cases. Furthermore, our work opens upexciting directions for investigation.

Journal

Artificial Intelligence ReviewSpringer Journals

Published: Oct 10, 2004

There are no references for this article.