维普中文期刊产品整合服务
80篇 您的检索式:作者名="Yannakakis"
    题名 作者 年代 出处 被引量
1Second Order Nonlinear Evolution Inclusions Ⅱ: Structure of the Solution Set显示文摘我们继续开始在的工作[1 ]( 第二订非线性的进化包括我:存在和松驰结果。Acta 数学科学,英语系列, 21 (5 ) , 977-966 (2005 )) 并且学习在进化三元组的分析框架被定义的第二顺序进化包括的答案集合的结构的性质。为凸的问题,我们证明答案集合是紧缩的 R 未,当为 nonconvex 问题我们证明它是连接的路径时。仅当 multivalued 非线性是凸的,另外,我们证明答案集合被关上珍视。最后,我们由与断绝考虑一个非线性的夸张问题说明结果。关键词进化三元组 - 紧缩的嵌入 - 第二顺序进化 - 紧缩的 R 未 - Pathconnected - 连接 - 连续统 - 夸张问题先生(2000 ) 题目分类 34G20 -Nikolaos S. PAPAGEORGIOU Nikolaos YANNAKAKIS 2006Acta Mathematica Sinica,English Series2006,22,1:2
2Edge dominating sets in graphs显示文摘Yannakakis M Gavril F 1980SIAM J Appl Math1980,38,:2
3Preference learning for cognitive modeling: a case study on entertainment preferences显示文摘YANNAKAKIS G N MARAGOUDAKIS M HALLAM J 2009IEEE Transactions on Systems Man and Cybernet- ics Part A: Systems and Humans2009,39,6:1
4Computing the Minimum Fill-in is NP-complete 显示文摘Yannakakis M 1981SIAM J Alg Disc Math1981,1,1:1
5Computing the Minimum Fill - in Is NP- Complete显示文摘YANNAKAKIS M 1981SLAM J Alg- Disc Math1981,1,1:1
6Edge Dominating Sets in Graphs显示文摘YANNAKAKIS M GAVEIL F 1980Siam J Appl Math1980,38,:1
7Optimization, approximation, and complexity classes 显示文摘PAPADIMITRIOU C YANNAKAKIS M 1991Journal of Computer and System Sciences1991,43,:1
8Analysis of recursive state machines显示文摘Rajeev Alur Michael Benedikt Kousha Etessami Patrice Godefroid Thomas Reps Mihalis Yannakakis 2005ACM Transactions on Programming Languages and Systems (TOPLAS)2005,,:1
9Scheduling Interval- ordered Tasks显示文摘C H Papadimitriou M Yannakakis 1979SIAM Journal on Computing1979,8,3:1
10Optimization, approximation, and complexity classes 显示文摘PAPADIMITRIOU C YANNAKAKIS M 1991J Comput Sys Sci1991,43,3:1
11Batch sizing and sequencing on a single machine显示文摘COFFMAN E G YANNAKAKIS M MAGAZINE M J 1990Ann Oper Res1990,26,:1
12Learning deep physiological models of affect 显示文摘MARTINEZ H P BENGIO Y YANNAKAKIS G N 2013Com- putational Intelligence Magazine IEEE2013,8,2:1
13Principles and methods of testing finate state machines: a survey 显示文摘LEE D YANNAKAKIS M 1996Proceedings of the IEEE1996,84,8:1
14Towards an Architecture Inde- pendent Analysis of Parallel Algorithms显示文摘C H Papadimitriou M Yannakakis 1990SIAM Journal on Com- puting1990,19,2:1
15On the Hardness of Approximating Minimization Problems显示文摘 Yannakakis M 1994Journal of the ACM1994,41,:1
16How easy is local search显示文摘Johnson D S Papadim It Riou C H Yannakakis M 1988Journal of Computer and System Sciences1988,37,1:1
17Optimization, approximation and complexity classes 显示文摘Papadimitriou C H Yannakakis M 1991Journal of Computer and System Sciences1991,43,3:1
18How easy is local search显示文摘Johnson D S Papadimitriou C H Yannakakis M 1988Journal of Computer and System Science1988,37,1:1
19Principles and methods of testing finite state machines-a survey显示文摘Lee D Yannakakis M 1996Proceedings of the IEEE1996,84,8:1
20Principles and methods of testing finite state machines-a survey 显示文摘LEE D YANNAKAKIS M 1996Proceedings of the IEEE1996,84,8:1
返回顶部 每页显示:
共4页 首页 上一页 第1页 下一页 末页 /4 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费