Lattice-Search Runtime Distributions May Be Heavy-Tailed. Zelezný, F., Srinivasan, A., & Page, D. In Matwin, S. & Sammut, C., editors, ILP, volume 2583, of Lecture Notes in Computer Science, pages 333-345, 2002. Springer.
Lattice-Search Runtime Distributions May Be Heavy-Tailed. [link]Link  Lattice-Search Runtime Distributions May Be Heavy-Tailed. [link]Paper  bibtex   
@inproceedings{conf/ilp/ZeleznySP02,
  author = {Zelezný, Filip and Srinivasan, Ashwin and Page, David},
  booktitle = {ILP},
  crossref = {conf/ilp/2002},
  editor = {Matwin, Stan and Sammut, Claude},
  ee = {http://dx.doi.org/10.1007/3-540-36468-4_22},
  interhash = {00af4bc3e13c1dfc1f4787c09c2d93b9},
  intrahash = {8c9d3509e6d3c54f5971dd89167a26cb},
  isbn = {3-540-00567-6},
  pages = {333-345},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Lattice-Search Runtime Distributions May Be Heavy-Tailed.},
  url = {http://dblp.uni-trier.de/db/conf/ilp/ilp2002.html#ZeleznySP02},
  volume = 2583,
  year = 2002
}

Downloads: 0