Italian Conference on Theoretical Computer Science最新文献

筛选
英文 中文
Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach 不完全知识下复杂行为的推理:一种模态方法
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_26
M. Baldoni, Laura Giordano, A. Martelli, V. Patti
{"title":"Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach","authors":"M. Baldoni, Laura Giordano, A. Martelli, V. Patti","doi":"10.1007/3-540-45446-2_26","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_26","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Online Advertising: Secure E-coupons 网络广告:安全的电子优惠券
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_24
S. Cimato, Annalisa De Bonis
{"title":"Online Advertising: Secure E-coupons","authors":"S. Cimato, Annalisa De Bonis","doi":"10.1007/3-540-45446-2_24","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_24","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116375215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
P Systems with Gemmation of Mobile Membranes 具有活动膜形成的P系统
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_9
D. Besozzi, C. Zandron, G. Mauri, N. Sabadini
{"title":"P Systems with Gemmation of Mobile Membranes","authors":"D. Besozzi, C. Zandron, G. Mauri, N. Sabadini","doi":"10.1007/3-540-45446-2_9","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_9","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116707063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold 优惠券收集器,q-二项式系数和不满意阈值
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_21
A. Kaporis, L. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito
{"title":"Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold","authors":"A. Kaporis, L. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito","doi":"10.1007/3-540-45446-2_21","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_21","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116189290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots 瞬时动作与完全异步:一组自主移动机器人的控制与协调
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_10
G. Prencipe
{"title":"Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots","authors":"G. Prencipe","doi":"10.1007/3-540-45446-2_10","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_10","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123197328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 64
Job Shop Scheduling Problems with Controllable Processing Times 加工时间可控的作业车间调度问题
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_7
K. Jansen, M. Mastrolilli, Roberto Solis-Oba
{"title":"Job Shop Scheduling Problems with Controllable Processing Times","authors":"K. Jansen, M. Mastrolilli, Roberto Solis-Oba","doi":"10.1007/3-540-45446-2_7","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_7","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123388709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A LTS Semantics of Ambients via Graph Synchronization with Mobility 基于移动性的图同步环境的LTS语义
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_1
G. Ferrari, U. Montanari, E. Tuosto
{"title":"A LTS Semantics of Ambients via Graph Synchronization with Mobility","authors":"G. Ferrari, U. Montanari, E. Tuosto","doi":"10.1007/3-540-45446-2_1","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_1","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130806757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
Distance Constrained Labeling of Precolored Trees 预着色树的距离约束标注
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_18
J. Fiala, Jan Kratochvíl, A. Proskurowski
{"title":"Distance Constrained Labeling of Precolored Trees","authors":"J. Fiala, Jan Kratochvíl, A. Proskurowski","doi":"10.1007/3-540-45446-2_18","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_18","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126682768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
Confluence of Untyped Lambda Calculus via Simple Types 通过简单类型的无类型λ演算的合流
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_3
S. Ghilezan, Viktor Kunčak
{"title":"Confluence of Untyped Lambda Calculus via Simple Types","authors":"S. Ghilezan, Viktor Kunčak","doi":"10.1007/3-540-45446-2_3","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_3","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121150547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Complexity of Layered Binary Search Trees with Relaxed Balance 具有松弛平衡的分层二叉搜索树的复杂度
Italian Conference on Theoretical Computer Science Pub Date : 2001-10-04 DOI: 10.1007/3-540-45446-2_17
Lars Jacobsen, Kim S. Larsen
{"title":"Complexity of Layered Binary Search Trees with Relaxed Balance","authors":"Lars Jacobsen, Kim S. Larsen","doi":"10.1007/3-540-45446-2_17","DOIUrl":"https://doi.org/10.1007/3-540-45446-2_17","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126036842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信