Filters








54,504 Hits in 3.4 sec

A Portfolio Approach to Algorithm Selection

Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham
2003 International Joint Conference on Artificial Intelligence  
In short, the method proposed in that work is: 1542 A Portfolio Approach to Algorithm Select 2.  ...  By far, the most common approach to algorithm selection has been to measure different algorithms' performance on a given problem distribution, and then to use only the algorithm having the lowest average  ... 
dblp:conf/ijcai/Leyton-BrownNAMS03 fatcat:s6f4ary3nrfdtkv2ayloqj5yiq

A Portfolio Approach to Algorithm Selection for Discrete Time-Cost Trade-off Problem [article]

Santosh Mungle
2017 arXiv   pre-print
In this paper, instead of using a single algorithm to solve DTCTP, we use a portfolio approach that takes multiple algorithms as its constituent.  ...  Moreover, portfolio approach provides an insight in selecting the best algorithm for all benchmark instances of DTCTP.  ...  Conclusion and Future Research This paper proposes a portfolio approach to algorithm selection for discrete time-cost trade-off problem in the multi-objective environment.  ... 
arXiv:1412.1913v2 fatcat:d3qckrxop5aazb6mc4gded6dma

From Sequential Algorithm Selection to Parallel Portfolio Selection [chapter]

M. Lindauer, H. Hoos, F. Hutter
2015 Lecture Notes in Computer Science  
In view of the increasing importance of hardware parallelism, a natural extension of per-instance algorithm selection is to select a set of algorithms to be run in parallel on a given problem instance,  ...  To this end, we leverage the machine learning models used by existing sequential algorithm selectors, such as 3S , ISAC , SATzilla and ME-ASP, and modify their selection procedures to produce a ranking  ...  Selection of Parallel Portfolios In this section, we show how to extend existing sequential algorithm selection approaches to handle parallel portfolio selection.  ... 
doi:10.1007/978-3-319-19084-6_1 fatcat:wnxxcfhlrjas5cb4lvuiamrez4

Algorithm Selection for Combinatorial Search Problems: A Survey [chapter]

Lars Kotthoff
2016 Lecture Notes in Computer Science  
In some scenarios, a new algorithm is clearly superior to previous approaches.  ...  developed in n The algorithm selection problem is concerned with selecting the best algorithm to solve a given problem instance on a case-bycase basis.  ...  I also thank the anonymous reviewers whose detailed comments helped to greatly improve it, and Barry O'Sullivan who suggested submitting to AI Magazine.  ... 
doi:10.1007/978-3-319-50137-6_7 fatcat:ejwwnd52bzeahdvk5aidvj6foi

Algorithm Selection for Combinatorial Search Problems: A Survey

Lars Kotthoff
2014 The AI Magazine  
The algorithm selection problem is concerned with selecting the best algorithm to solve a given problem instance on a case-by-case basis.  ...  The comprehensive classification of approaches identifies and analyses the different directions from which algorithm selection has been approached.  ...  I also thank the anonymous reviewers whose detailed comments helped to greatly improve it, and Barry O'Sullivan who suggested submitting to AI Magazine.  ... 
doi:10.1609/aimag.v35i3.2460 fatcat:fpc6zq4ko5dh5fbpwnlpouz2xe

Algorithm Selection for Combinatorial Search Problems: A Survey [article]

Lars Kotthoff
2012 arXiv   pre-print
The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a case-by-case basis.  ...  The comprehensive classification of approaches identifies and analyses the different directions from which Algorithm Selection has been approached.  ...  We also thank the anonymous reviewers of a previous version of this paper whose detailed comments helped to greatly improve it. This work was supported by an EPSRC doctoral prize.  ... 
arXiv:1210.7959v1 fatcat:o5jq4dlk2vcrpgvhrx6lvxekpa

On Portfolios for Backtracking Search in the Presence of Deadlines

Huayue Wu, Peter van Beek
2007 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007)  
Previous studies have shown that portfolios of backtracking algorithms-a selection of one or more algorithms plus a schedule for executing the algorithms-can dramatically improve performance on some instances  ...  For such a scenario, we present a simple scheme for learning a good portfolio of backtracking algorithms from a small sample of instances.  ...  , and can approach the performance of an algorithm selection portfolio which uses an oracle to always select the best algorithm for each instance.  ... 
doi:10.1109/ictai.2007.38 dblp:conf/ictai/WuB07 fatcat:rgbjdbqjcferdbmro72jmf7xqu

Designing and Comparing Multiple Portfolios of Parameter Configurations for Online Algorithm Selection [chapter]

Aldy Gunawan, Hoong Chuin Lau, Mustafa Mısır
2016 Lecture Notes in Computer Science  
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems.  ...  These ranges are further processed to determine a portfolio of parameter configurations, which would be used within two online Algorithm Selection approaches for solving different instances of a given  ...  Our aim is to develop a generic approach for designing algorithm portfolio of parameter configurations for use within an online algorithm selection process to solve combinatorial optimization problems.  ... 
doi:10.1007/978-3-319-50349-3_7 fatcat:f4oq5yygvbbx3ady7uk3xdrehu

claspfolio 2

Holger Hoos, Marius Lindauer, Torsten Schaub
2018 Postprints der Universität Potsdam: Mathematisch-Naturwissenschaftliche Reihe  
As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework.  ...  Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection  ...  Algorithm Selection Approaches As previously mentioned, claspfolio 2 was explicitly designed to easily integrate several state-of-the-art algorithm selection approaches.  ... 
doi:10.25932/publishup-41612 fatcat:ermp4hpsivfvvayucikfmrhx7i

A novel evolutionary optimization algorithm based solution approach for portfolio selection problem

Mohammad Shahid, Mohd Shamim, Zubair Ashraf, Mohd Shamim Ansari
2022 IAES International Journal of Artificial Intelligence (IJ-AI)  
In this paper, a novel portfolio selection model using SFS based optimization approach has been proposed to maximize Sharpe ratio. SFS is an evolutionary approach.  ...  <span>The portfolio selection problem is one of the most common problems which drawn the attention of experts of the field in recent decades.  ...  Some hybrid approaches are also reported to combine meta-heuristics with exact algorithms or other meta-heuristics to deal with complicated portfolio selection problem.  ... 
doi:10.11591/ijai.v11.i3.pp843-850 fatcat:t6mgfp34snbxjkzpini5ba72te

claspfolio 2: Advances in Algorithm Selection for Answer Set Programming [article]

Holger Hoos and Marius Lindauer and Torsten Schaub
2014 arXiv   pre-print
As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework.  ...  Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection  ...  Algorithm Selection Approaches As previously mentioned, claspfolio 2 was explicitly designed to easily integrate several stateof-the-art algorithm selection approaches.  ... 
arXiv:1405.1520v1 fatcat:p7ddpwwi25ghpfkgfbjthzvqve

A Guide to Portfolio-Based Planning [chapter]

Mauro Vallati
2012 Lecture Notes in Computer Science  
This observation motivated the idea of configuring and exploiting a portfolio of planners to achieve better performances than any individual planner: some recent planning systems based on this idea achieved  ...  Such results let suppose that future challenges of Automated Planning community will converge on designing different approaches for combining existing planning algorithms.  ...  Further studies are needed to analyze the highlighted open issues and to increase the performances that can be achieved by exploiting a portfolio approach in Automated Planning.  ... 
doi:10.1007/978-3-642-35455-7_6 fatcat:tsfirbpxwbawte2kel6ofqtp54

PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH

HUAYUE WU, PETER VAN BEEK
2008 International journal on artificial intelligence tools  
Previous studies have shown that portfolios of backtracking algorithms-a selection of one or more algorithms plus a schedule for executing the algorithms-can dramatically improve performance on some instances  ...  For such a scenario, we present a simple scheme for learning a good portfolio of backtracking algorithms from a small sample of instances.  ...  each instance, and can approach the performance of an algorithm selection portfolio which uses an oracle to always select the best algorithm for each instance.  ... 
doi:10.1142/s0218213008004187 fatcat:uqjjfspdondd7ll65efgeq6ine

Strategic Bayesian Asset Allocation [article]

Vadim Sokolov, Michael Polson
2019 arXiv   pre-print
We tailor standard sparse MCMC algorithms to calculate portfolio weights and perform selection.  ...  Our approach uses Bayesian regularization to not only provide stock selection but also optimal sequential portfolio weights.  ...  We demonstrate how Laplace regularized portfolios allocations and the corresponding LARS algorithms leads to an intuitive way to select an optimal portfolio and assign a selection order of the stocks to  ... 
arXiv:1905.08414v2 fatcat:eywy3myeezesfa5cwdww5tptjq

Building algorithm portfolios for memetic algorithms

Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
2014 Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion - GECCO Comp '14  
The set is expected to have algorithm combinations complementing each other with respect to their strengths in a portfolio setting.  ...  The present study introduces an automated mechanism to build algorithm portfolios for memetic algorithms.  ...  A simple online algorithm selection approach, i.e. uniform random selection, that chooses an algorithm from the portfolio and applies it to a solution at each step of a generation is utilised.  ... 
doi:10.1145/2598394.2598455 dblp:conf/gecco/MisirHL14 fatcat:u5pxwfjznnh3fdb2z757ai5ooa
« Previous Showing results 1 — 15 out of 54,504 results