Generation of Efficient Programs for Solving Maximum Multi-marking Problems.


https://doi.org/10.1007/3-540-44806-3_5
@inproceedings{DBLP:conf/saig/SasanoHT01, author = {Isao Sasano and Zhenjiang Hu and Masato Takeichi}, editor = {Walid Taha}, title = {Generation of Efficient Programs for Solving Maximum Multi-marking Problems}, booktitle = {Semantics, Applications, and Implementation of Program Generation, Second International Workshop, {SAIG} 2001, Florence, Italy, September 6, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2196}, pages = {72--91}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44806-3\_5}, doi = {10.1007/3-540-44806-3\_5}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/saig/SasanoHT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21