Marek Petrik Shlomo Zilberstein  Home/Search
Context
Related
| umass.edu/aimath06/proceeding...P45.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu/aimath06/proceedings (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an approach for improving the performance of combinatorial optimization algorithms by generating an optimal Parallel Portfolio of Algorithms (PPA). A PPA is a collection of diverse algorithms for solving a single problem, all running concurrently on a single processor until a solution is produced. The performance of the portfolio may be controlled by assigning di#erent shares of processor time to each algorithm. We present a method for finding a static PPA, in which the share of ... (Update)
Active bibliography (related documents): More All
0.8: Creatures: Entertainment Software Agents with Artificial Life - Grand, Cliff (1997) (Correct)
0.2: Approximate Reasoning Using Anytime Algorithms - Zilberstein, Russell (1995) (Correct)
0.2: Deferred Planning and Sensor Use - Olawsky, Gini (1990) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ petrik-learning,
author = "Marek Petrik Petrik",
title = "Learning Static Parallel Portfolios of Algorithms",
url = "citeseer.ist.psu.edu/738917.html" }
Citations (may not include all citations):976 Machine Learning (context) - Mitchell - 1997
461 Nonlinear Programming (context) - Bertsekas - 2003
296 A Probabilistic Theory of Pattern Recognition (context) - Devroye, Gyorfi et al. - 2001
81 Operational Rationality through Compilation of Anytime Algor.. - Zilberstein - 1993
73 Unifying SAT-based and graph-based planning - Kautz, Selman - 1999
7 Boosting as a metaphor for algorithm design (context) - Leyton-Brown, Nudelman et al. - 2003
5 Intractability and time-dependent planning (context) - Dean - 1986
5 Website httpwww (context) - Website, lri et al. - 2005
1 Dynamic composition of information retrieval techniques - Arnt, Zilberstein et al. - 2004
1 Learning parallel portfolios of algorithms (context) - Petrik - 2005
1 Statistically optimal combination of algorithms (context) - Petrik - 2005
Documents on the same site (http://anytime.cs.umass.edu/aimath06/proceedings.html): More
Finding Small Unsatisfiable Cores to Prove.. - Interian, Corvera.. (Correct)
Scalable Inference in Hierarchical Generative Models - Dean (Correct)
Approximate Linear Programming for Solving Hybrid Factored MDPs - Hauskrecht, Kveton (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC