We discuss two experimental designs and show how to use them to evaluate difficult empirical combinatorial problems. We restrict our analysis here to the knapsack problem but comment more generally on the use of computational testing to analyze the performances of algorithms.
Optimal combinatorial mechanism design
✍ Scribed by Levent Ülkü
- Book ID
- 120746823
- Publisher
- Springer
- Year
- 2012
- Tongue
- English
- Weight
- 294 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0938-2259
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This is a high level state-of-the-art conference. Some of t&,n@ti pgominent workers from North America and other parts of the world a areexpected to be the invited speakers. Besides, there will be contributed paper sessions, and panel discussions. The conference, sponsored by the U.S. Air Force and
Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this pap