RI | Publications | Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space

Text only version of this site

Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space
S. Baluja and S. Davies
Proceedings of the 1997 International Conference on Machine Learning, 1997.

Jump to: Download | Text Reference | BibTeX Reference

Download [Help]

Adobe portable document format (pdf) [58 KB]
Compressed postscript (ps.gz) [72 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Text Reference

S. Baluja and S. Davies, "Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space," Proceedings of the 1997 International Conference on Machine Learning, 1997.

BibTeX Reference

@inproceedings{Baluja_1997_2957,
   author = "Shumeet Baluja and Scott Davies",
   title = "Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space",
   booktitle = "Proceedings of the 1997 International Conference on Machine Learning",
   year = "1997"
}