default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri Malitsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j5]Carlos Ansótegui
, Joel Gabàs, Yuri Malitsky, Meinolf Sellmann:
MaxSAT by improved instance-specific algorithm configuration. Artif. Intell. 235: 26-39 (2016)- [j4]Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Fréchette, Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, Joaquin Vanschoren:
ASlib: A benchmark library for algorithm selection. Artif. Intell. 237: 41-58 (2016) - [j3]Giovanni M. Di Liberto, Serdar Kadioglu, Kevin Leo, Yuri Malitsky:
DASH: Dynamic Approach for Switching Heuristics. Eur. J. Oper. Res. 248(3): 943-953 (2016) - [c33]Andrea Loreggia, Yuri Malitsky, Horst Samulowitz, Vijay A. Saraswat:
Deep Learning for Algorithm Portfolios. AAAI 2016: 1280-1286 - [c32]Yuri Malitsky, Marius Merschformann, Barry O'Sullivan, Kevin Tierney:
Structure-Preserving Instance Generation. LION 2016: 123-140 - [p1]Barry Hurley, Lars Kotthoff, Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
Advanced Portfolio Techniques. Data Mining and Constraint Programming 2016: 191-225 - 2015
- [j2]Yuri Malitsky:
Instance-specific algorithm configuration. Constraints An Int. J. 20(4): 474 (2015) - [c31]Alain Biem, Maria Butrico, Mark Feblowitz, Tim Klinger, Yuri Malitsky, Kenney Ng, Adam Perer, Chandra Reddy, Anton Riabov, Horst Samulowitz, Daby M. Sow, Gerald Tesauro, Deepak S. Turaga:
Towards Cognitive Automation of Data Science. AAAI 2015: 4268-4269 - [c30]Tadhg Fitzgerald, Yuri Malitsky, Barry O'Sullivan:
ReACTR: Realtime Algorithm Configuration through Tournament Rankings. IJCAI 2015: 304-310 - [c29]Carlos Ansótegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney:
Model-Based Genetic Algorithms for Algorithm Configuration. IJCAI 2015: 733-739 - [c28]Kevin Tierney, Yuri Malitsky:
An Algorithm Selection Benchmark of the Container Pre-marshalling Problem. LION 2015: 17-22 - [e1]Frank Hutter, Marius Lindauer, Yuri Malitsky:
Algorithm Configuration, Papers from the 2015 AAAI Workshop, Austin, Texas, USA, January 26, 2015. AAAI Technical Report WS-15-01, AAAI Press 2015, ISBN 978-1-57735-712-4 [contents] - [i5]Stefano V. Albrecht, J. Christopher Beck, David L. Buckeridge, Adi Botea, Cornelia Caragea, Chi-Hung Chi, Theodoros Damoulas, Bistra Dilkina, Eric Eaton, Pooyan Fazli, Sam Ganzfried, Marius Lindauer, Marlos C. Machado, Yuri Malitsky, Gary Marcus, Sebastiaan A. Meijer, Francesca Rossi, Arash Shaban-Nejad, Sylvie Thiébaux, Manuela M. Veloso, Toby Walsh, Can Wang, Jie Zhang, Yu Zheng:
Reports from the 2015 AAAI Workshop Program. AI Mag. 36(2): 90-101 (2015) - [i4]Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Fréchette, Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, Joaquin Vanschoren:
ASlib: A Benchmark Library for Algorithm Selection. CoRR abs/1506.02465 (2015) - 2014
- [b2]Yuri Malitsky:
Instance-Specific Algorithm Configuration. Springer 2014, ISBN 978-3-319-11229-9, pp. 1-128 - [c27]Carlos Ansótegui, Yuri Malitsky, Meinolf Sellmann:
MaxSAT by Improved Instance-Specific Algorithm Configuration. AAAI 2014: 2594-2600 - [c26]Tadhg Fitzgerald, Barry O'Sullivan, Yuri Malitsky, Kevin Tierney:
Online Search Algorithm Configuration. AAAI 2014: 3104-3105 - [c25]Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan:
Proteus: A Hierarchical Portfolio of Solvers and Transformations. CPAIOR 2014: 301-317 - [c24]Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, João Marques-Silva:
A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems. CPAIOR 2014: 368-376 - [c23]Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, João Marques-Silva:
Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems. ECAI 2014: 1065-1066 - [c22]Daniel Geschwender, Frank Hutter, Lars Kotthoff, Yuri Malitsky, Holger H. Hoos, Kevin Leyton-Brown:
Algorithm Configuration in the Cloud: A Feasibility Study. LION 2014: 41-46 - [c21]Tadhg Fitzgerald, Yuri Malitsky, Barry O'Sullivan, Kevin Tierney:
ReACT: Real-Time Algorithm Configuration through Tournaments. SOCS 2014: 62-70 - [c20]Yuri Malitsky, Barry O'Sullivan:
Latent Features for Algorithm Selection. SOCS 2014: 123-130 - [i3]Barry Hurley, Serdar Kadioglu, Yuri Malitsky, Barry O'Sullivan:
Transformation-based Feature Computation for Algorithm Portfolios. CoRR abs/1401.2474 (2014) - 2013
- [c19]Yuri Malitsky, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem. CPAIOR 2013: 176-192 - [c18]Deepak Mehta, Barry O'Sullivan, Lars Kotthoff, Yuri Malitsky:
Lazy Branching for Constraint Satisfaction. ICTAI 2013: 1012-1019 - [c17]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. IJCAI 2013: 608-614 - [c16]Tinus Abell, Yuri Malitsky, Kevin Tierney:
Features for Exploiting Black-Box Optimization Problem Structure. LION 2013: 30-36 - [c15]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction. LION 2013: 153-167 - [c14]Marco Collautti, Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios. ECML/PKDD (3) 2013: 435-450 - [c13]Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
Evolving Instance Specific Algorithm Configuration. SOCS 2013: 133-140 - [i2]Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan:
Proteus: A Hierarchical Portfolio of Solvers and Transformations. CoRR abs/1306.5606 (2013) - [i1]Giovanni M. Di Liberto, Serdar Kadioglu, Kevin Leo, Yuri Malitsky:
DASH: Dynamic Approach for Switching Heuristics. CoRR abs/1307.4689 (2013) - 2012
- [b1]Yuri Malitsky:
Instance-Specific Algorithm Configuration. Brown University, USA, 2012 - [c12]Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann:
Non-Model-Based Search Guidance for Set Partitioning Problems. AAAI 2012: 493-498 - [c11]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Parallel SAT Solver Selection and Scheduling. CP 2012: 512-526 - [c10]Yuri Malitsky, Meinolf Sellmann:
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 - 2011
- [c9]Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Algorithm Selection and Scheduling. CP 2011: 454-469 - [c8]Christian Kroer, Yuri Malitsky:
Feature Filtering for Instance-Specific Algorithm Configuration. ICTAI 2011: 849-855 - [c7]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Non-Model-Based Algorithm Portfolios for SAT. SAT 2011: 369-370 - 2010
- [j1]Yuri Malitsky, Meinolf Sellmann:
Stochastic Offline Programming. Int. J. Artif. Intell. Tools 19(4): 351-371 (2010) - [c6]Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek:
Filtering Bounded Knapsack Constraints in Expected Sublinear Time. AAAI 2010: 141-146 - [c5]Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, Kevin Tierney:
ISAC - Instance-Specific Algorithm Configuration. ECAI 2010: 751-756
2000 – 2009
- 2009
- [c4]Bistra Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann:
Backdoors to Combinatorial Optimization: Feasibility and Optimality. CPAIOR 2009: 56-70 - [c3]Yuri Malitsky, Meinolf Sellmann:
Stochastic Offline Programming. ICTAI 2009: 784-791 - 2008
- [c2]Yuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve:
Length-Lex Bounds Consistency for Knapsack Constraints. CP 2008: 266-281 - 2006
- [c1]Christopher Fellows, Yuri Malitsky, Gregory Wojtaszczyk:
Exploring GnuGo's Evaluation Function with a SVM. AAAI 2006: 1867-1868
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
