维普期刊资源整合服务平台（V6.5）

1832篇 您的检索式：期刊名="Information Processing Letter"

选中清除导出查看参考文献查看引证文献引用追踪共92页首页上一页第1页下一页末页 /92 跳转

	题名	作者	年代	出处	被引量
1	An efficient method for computing dynamic program slices 显示文摘	Goswami D Mall R	2002	Information Processing Letters2002，81，2：	2
2	The particle swarm optimization algorithm: convergence analysis and parameter selection显示文摘	Ioan Cristian Trelea	2002	Information Processing Letters2002，，6：	2
3	The particle swarm optimization algorithm: convergence analysis and parameter selection显示文摘	Ioan Cristian Trelea	2002	Information Processing Letters2002，，6：	2
4	The particle swarm optimization algorithm: Convergence analysis and parameter selection 显示文摘	Cristian TI	2003	Information Processing Letters (S0020-0190)2003，85，6：	1
5	The Greedy and Delaunay Triangulations are Not Bad in the Average Case显示文摘		1986	Information Processing Letters1986，，22：	1
6	Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm显示文摘	Dorronsoro B	2006	Information Processing Letters2006，，98：	1
7	Visual cryptography for grey level images显示文摘	De Santis A Naor M	2000	Information Processing Letters2000，75，6：	1
8	Bipartite structure of all complex networks显示文摘	Guillaume J L Latapy M	2004	Information Processing Letters2004，90，：	1
9	ACO algorithms with guaranteed convergence to the optimal solution显示文摘	WALTER J GUTJAHR	2002	Information Processing Letters2002，82，3：	1
10	OnDorninationNurnber of Cartesian Product of Directed Cycles 显示文摘	LiuJuan ZhangXin-dong ChenXing etal	2010	Information Processing Letters2010，110，5：	1
11	How much can lookahead help in online single machine scheduling 显示文摘	Zheng F F Xu Y F Zhang E	2008	Information Processing Letters2008，106，：	1
12	A lower bound for online bin packing显示文摘	Liang F M	1980	Information Processing Letters1980，10，：	1
13	A faster computation of the most vital edge of a shortest path between two nodes 显示文摘	NARDELLI E PROIETTI G WIDMAYER P	2001	Information Processing Letters2001，79，2：	1
14	A calculus of durations显示文摘	HOARE C A R RAVN A P	1991	Information Processing Letters1991，40，5：	1
15	An algorithm for draw in undirected graphs显示文摘	Kamada T Kawai S	1989	Information Processing Letters1989，，31：	1
16	Time-varying PSO-convergence analysis, convergence-related parameterization and new parameter adjustment schemes显示文摘	Rapaic M R Kanovic Z	2009	Information Processing Letters2009，109，11：	1
17	Block-wise 2D kernel PCA/LDA for face recognition 显示文摘	Eftekhari A Forouzanfar M Abrishami M H	2010	Information Processing Letters2010，110，17：	1
18	An optimal algorithm for reconstruct- ing a binary tree显示文摘	Kamakoti V Rangan C P	1992	Information Processing Letters1992，42，2：	1
19	Bipartite structure of all complex networks显示文摘	Guillaume J L Latapy M	2004	Information Processing Letters2004，90，：	1
20	ACO algorithm with guaranteed convergence to the optimal 显示文摘	WALTER J	2002	Solution Information Processing Letters2002，82，3：	1

返回顶部每页显示：

共92页首页上一页第1页下一页末页 /92 跳转

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

用户提示