|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Estimating the Work in Integer Partitioning
January/February 2003 (vol. 5 no. 1)
pp. 48-56
| ASCII Text | x | ||
| April K. Andreas, Isabel Beichl, "Estimating the Work in Integer Partitioning," Computing in Science and Engineering, vol. 5, no. 1, pp. 48-56, January/February, 2003. | |||
| BibTex | x | ||
| @article{ 10.1109/MCISE.2003.1166552, author = {April K. Andreas and Isabel Beichl}, title = {Estimating the Work in Integer Partitioning}, journal ={Computing in Science and Engineering}, volume = {5}, number = {1}, issn = {1521-9615}, year = {2003}, pages = {48-56}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCISE.2003.1166552}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computing in Science and Engineering TI - Estimating the Work in Integer Partitioning IS - 1 SN - 1521-9615 SP48 EP56 EPD - 48-56 A1 - April K. Andreas, A1 - Isabel Beichl, PY - 2003 KW - integer partition KW - algorithms KW - Monte Carlo methods KW - multiprocessing VL - 5 JA - Computing in Science and Engineering ER - | |||
An integer partition for a set of integers is a way to divide that set of numbers into two or more subsets, with approximately the same sum in each subset and the same number of elements in each subset. The authors have developed a method to estimate the work done by commonly used algorithms. Their method is based on one of Knuth's methods for estimating the size of backtrack trees.
Index Terms:
integer partition, algorithms, Monte Carlo methods, multiprocessing
Citation:
April K. Andreas, Isabel Beichl, "Estimating the Work in Integer Partitioning," Computing in Science and Engineering, vol. 5, no. 1, pp. 48-56, Jan.-Feb. 2003, doi:10.1109/MCISE.2003.1166552
Usage of this product signifies your acceptance of the Terms of Use.