The Strength of Weak Learnability
Machine Learning
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Algorithm Selection using Reinforcement Learning
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Bayesian Approach to Tackling Hard Computational Problems
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
Cross-disciplinary perspectives on meta-learning for algorithm selection
ACM Computing Surveys (CSUR)
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An Efficient and Adaptive Mechanism for Parallel Simulation Replication
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
Bid evaluation in combinatorial auctions: optimization and learning
Software—Practice & Experience
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Learning against opponents with bounded memory
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
SATzilla-07: the design and analysis of an algorithm portfolio for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
Learning When to Use Lazy Learning in Constraint Solving
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Fastest association rule mining algorithm predictor (FARM-AP)
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
Boosting distributed constraint satisfaction
Journal of Heuristics
Non-model-based algorithm portfolios for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Algorithm selection and scheduling
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
pupyMPI - MPI implemented in pure python
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Communications of the ACM
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Instance-Specific algorithm configuration as a method for non-model-based portfolio generation
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An evaluation of machine learning in algorithm selection for search problems
AI Communications - The Symposium on Combinatorial Search
Evaluating component solver contributions to portfolio-based algorithm selectors
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Snappy: a simple algorithm portfolio
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Models of performance of time series forecasters
Neurocomputing
Towards making autotuning mainstream
International Journal of High Performance Computing Applications
| Hi-index | 0.02 |