bi.bib 1.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  1. @book{Knuth,
  2. author = {Knuth, Donald E.},
  3. title = {The Art of Computer Programming, Volume 2 (3rd Ed.): Seminumerical Algorithms},
  4. page = {142},
  5. year = {1997},
  6. isbn = {0-201-89684-2},
  7. publisher = {Addison-Wesley Longman Publishing Co., Inc.},
  8. address = {Boston, MA, USA},
  9. }
  10. @misc{Magnus,
  11. author = {Magnus Wahlström},
  12. title = {discrcalc.tar.gz},
  13. url = {http://people.mpi-inf.mpg.de/~wahl/},
  14. keywords = {discrepancy, supersampling},
  15. }
  16. @article{Dobkin,
  17. author = {Dobkin, David P. and Eppstein, David and Mitchell, Don P.},
  18. title = {Computing the Discrepancy with Applications to Supersampling Patterns},
  19. journal = {ACM Trans. Graph.},
  20. issue_date = {Oct. 1996},
  21. volume = {15},
  22. number = {4},
  23. month = oct,
  24. year = {1996},
  25. issn = {0730-0301},
  26. pages = {354--376},
  27. numpages = {23},
  28. url = {http://doi.acm.org/10.1145/234535.234536},
  29. doi = {10.1145/234535.234536},
  30. acmid = {234536},
  31. publisher = {ACM},
  32. address = {New York, NY, USA},
  33. keywords = {discrepancy, supersampling},
  34. }
  35. @inproceedings{Doerr,
  36. author = {Doerr, Carola and De Rainville, Fran\c{c}ois-Michel},
  37. title = {Constructing Low Star Discrepancy Point Sets with Genetic Algorithms},
  38. booktitle = {Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation},
  39. series = {GECCO '13},
  40. year = {2013},
  41. isbn = {978-1-4503-1963-8},
  42. location = {Amsterdam, The Netherlands},
  43. pages = {789--796},
  44. numpages = {8},
  45. url = {http://doi.acm.org/10.1145/2463372.2463469},
  46. doi = {10.1145/2463372.2463469},
  47. acmid = {2463469},
  48. publisher = {ACM},
  49. address = {New York, NY, USA},
  50. keywords = {algorithm engineering, genetic algorithms, geometric discrepancy, information-based complexity, monte-carlo methods, search heuristics},
  51. }