Yuri Malitsky

According to our database1, Yuri Malitsky authored at least 42 papers between 2006 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Advanced Portfolio Techniques.
Proceedings of the Data Mining and Constraint Programming, 2016

DASH: Dynamic Approach for Switching Heuristics.
Eur. J. Oper. Res., 2016

ASlib: A benchmark library for algorithm selection.
Artif. Intell., 2016

MaxSAT by improved instance-specific algorithm configuration.
Artif. Intell., 2016

Structure-Preserving Instance Generation.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Deep Learning for Algorithm Portfolios.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Instance-specific algorithm configuration.
Constraints An Int. J., 2015

Reports from the 2015 AAAI Workshop Program.
AI Mag., 2015

An Algorithm Selection Benchmark of the Container Pre-marshalling Problem.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

ReACTR: Realtime Algorithm Configuration through Tournament Rankings.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Model-Based Genetic Algorithms for Algorithm Configuration.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Towards Cognitive Automation of Data Science.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Transformation-based Feature Computation for Algorithm Portfolios.
CoRR, 2014

Latent Features for Algorithm Selection.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

ReACT: Real-Time Algorithm Configuration through Tournaments.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Algorithm Configuration in the Cloud: A Feasibility Study.
Proceedings of the Learning and Intelligent Optimization, 2014

Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Proteus: A Hierarchical Portfolio of Solvers and Transformations.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Online Search Algorithm Configuration.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

MaxSAT by Improved Instance-Specific Algorithm Configuration.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Instance-Specific Algorithm Configuration
Springer, ISBN: 978-3-319-11230-5, 2014

2013
Evolving Instance Specific Algorithm Configuration.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Features for Exploiting Black-Box Optimization Problem Structure.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering.
Proceedings of the IJCAI 2013, 2013

Lazy Branching for Constraint Satisfaction.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Instance-Specific Algorithm Configuration.
PhD thesis, 2012

Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Parallel SAT Solver Selection and Scheduling.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Non-Model-Based Search Guidance for Set Partitioning Problems.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Non-Model-Based Algorithm Portfolios for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Feature Filtering for Instance-Specific Algorithm Configuration.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Algorithm Selection and Scheduling.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
Stochastic Offline Programming.
Int. J. Artif. Intell. Tools, 2010

ISAC - Instance-Specific Algorithm Configuration.
Proceedings of the ECAI 2010, 2010

Filtering Bounded Knapsack Constraints in Expected Sublinear Time.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Backdoors to Combinatorial Optimization: Feasibility and Optimality.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Length-Lex Bounds Consistency for Knapsack Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2006
Exploring GnuGo's Evaluation Function with a SVM.
Proceedings of the Proceedings, 2006


  Loading...