SIGN IN
SIGN UP
Empirical hardness models: Methodology and a case study on combinatorial auctions
Full Text:
PDF
Buy this Article
Authors:
Kevin Leyton-Brown
University of British Columbia, Vancouver, British Columbia, Canada
Eugene Nudelman
Stanford University, Stanford, California
Yoav Shoham
Stanford University, Stanford, California
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 56 Issue 4, June 2009
Article No. 22
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1538902.1538906
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 59
· Downloads (cumulative): 510
· Citation Count: 9
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm portfolios
automatic analysis of algorithms
combinatorial auctions
empirical analysis of algorithms
graph and tree search strategies
heuristic methods
program synthesis
runtime prediction
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder