The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase empirical hardness (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2002-2009 (11)
Publication types (Num. hits)
article(2) inproceedings(9)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 9 keywords

Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Luca Pulina, Armando Tacchella Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. Search on Bibsonomy CP The full citation details ... 2002 DBLP  BibTeX  RDF
1Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham Empirical hardness models: Methodology and a case study on combinatorial auctions. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Empirical analysis of algorithms, algorithm portfolios, runtime prediction, combinatorial auctions
1Pablo Almajano, Jesús Cerquides, Juan A. Rodríguez-Aguilar Empirical Hardness for Mixed Auctions. Search on Bibsonomy CAEPIA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Calin Anton, Lane Olson Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism. Search on Bibsonomy Canadian Conference on AI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Luca Pulina, Armando Tacchella Hard QBF Encodings Made Easy: Dream or Reality? Search on Bibsonomy AI*IA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kate Smith-Miles Cross-disciplinary perspectives on meta-learning for algorithm selection. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dataset characterization, empirical hardness, landscape analysis, classification, combinatorial optimization, sorting, constraint satisfaction, forecasting, model selection, meta-learning, Algorithm selection
1Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown : The Design and Analysis of an Algorithm Portfolio for SAT. Search on Bibsonomy CP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lin Xu, Holger H. Hoos, Kevin Leyton-Brown Hierarchical Hardness Models for SAT. Search on Bibsonomy CP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevin Leyton-Brown Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoos, Alex Devkar, Yoav Shoham Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.