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.
β¦ LIBER β¦
Combinatorial optimization problems in wireless switch design
β Scribed by Renaud Sirdey
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 180 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1619-4500
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Optimal experimental design for combinat
β
Selden B. Grary; Cosimo Spera
π
Article
π
1996
π
Springer US
π
English
β 745 KB
Combinatorial optimization problems in t
β
D. Bauer; F. Boesch; C. Suffel; R. Tindell
π
Article
π
1985
π
John Wiley and Sons
π
English
β 668 KB
This paper presents some results regarding the design of reliable networks. The problem under consideration involves networks which are undirected graphs having equal and independent edge failure probabilities. The index of reliability is the probability that the network fails (becomes disconnected)
On local optima in multiobjective combin
β
Luis Paquete; Tommaso Schiavinotto; Thomas StΓΌtzle
π
Article
π
2007
π
Springer US
π
English
β 421 KB
Energy Efficient Schedulers in Wireless
β
Jeongjoon Lee; Catherine Rosenberg; Edwin K. P. Chong
π
Article
π
2006
π
Springer US
π
English
β 383 KB
Optimization problems in computer networ
β
S.I Samoylenko
π
Article
π
1981
π
Elsevier Science
β 773 KB
Heuristic procedures for solving combina
β
Heiner MΓΌller-Merbach
π
Article
π
1976
π
Elsevier Science
β 244 KB