设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(154)
知网期刊论文(66)
在“
Elsevier电子期刊
”中,
命中:
27
条,耗时:0.0220165 秒
在所有数据库中总计命中:
220
条
1.
Optimal suffix sorting and LCP array construction for
constant
alphabets
作者:
Felipe A. Louza
a
;
louza@ic.unicamp.br" class="auth_mail" title="E-mail the corresponding author
;
Simon Gog
b
;
gog@kit.edu" class="auth_mail" title="E-mail the corresponding author
;
Guilherme P. Telles
a
;
gpt@ic.unicamp.br" class="auth_mail" title="E-mail the corresponding author
关键词:
Data structures
;
Suffix array
;
LCP array
;
Linear time
;
Constant
space
刊名:Information Processing Letters
出版年:2017
2.
Reprint of: Memory-constrained algorithms for simple polygons
作者:
Tetsuo Asano
;
Kevin Buchin
;
Maike Buchin
;
Matias Korman
;
Wolfgang Mulzer
;
G眉nter Rote
;
Andr茅 Schulz
关键词:
Space&ndash
;
time trade-off
;
Constant
workspace
;
Triangulation
;
Shortest path
;
Simple polygon
刊名:Computational Geometry
出版年:April, 2014
3.
Workspace
analysis of 5-PRUR parallel mechanisms (3T2R)
作者:
Mohammad Hossein Saadatzi
a
;
mhsaadatzi@ieee.org
;
Mehdi Tale Masouleh
b
;
mehdi.tale-masouleh.1@ulaval.ca
;
Hamid D. Taghirad
a
;
taghirad@kntu.ac.ir
关键词:
5-DOF parallel mechanisms
;
Constant
-orientation
workspace
;
Three translational and two rotational (3T2R) motion pattern
;
CAD model
;
Geometric constructive approach
;
Bohemian dome
刊名:Robotics and Computer-Integrated Manufacturing
出版年:2012
4.
A 6-DOF reconfigurable hybrid parallel manipulator
作者:
Gianmarc Coppola
;
Dan Zhang
;
Kefu Liu
关键词:
Reconfigurable parallel manipulator
;
Hybrid robot
;
Parallel kinematics
;
Design optimization
;
6-DOF
刊名:Robotics and Computer-Integrated Manufacturing
出版年:April, 2014
5.
Memory-constrained algorithms for simple polygons
作者:
Tetsuo Asano
a
;
t-asano@jaist.ac.jp
;
Kevin Buchin
b
;
1
;
k.a.buchin@tue.nl
;
Maike Buchin
b
;
m.e.buchin@tue.nl
;
Matias Korman
c
;
2
;
matias.korman@upc.edu
;
Wolfgang Mulzer
d
;
mulzer@inf.fu-berlin.de
;
Gü
;
nter Rote
d
;
rote@inf.fu-berlin.de
;
André
;
Schulz
e
;
andre.schulz@uni-muenster.de
关键词:
Space&ndash
;
time trade-off
;
Constant
workspace
;
Triangulation
;
Shortest path
;
Simple polygon
刊名:Computational Geometry
出版年:2013
6.
Elastodynamic optimization of a 3T1R parallel manipulator
作者:
Cammarata Alessandro
;
acamma@dii.unict.it" class="auth_mail
;
Sinatra Rosario
关键词:
Parallel robots
;
Optimization
;
Elastodynamics
;
Vibrations
刊名:Mechanism and Machine Theory
出版年:March, 2014
7.
Mobility and kinematic analysis of a parallel mechanism with both PPR and planar operation modes
作者:
Maurizio Ruggiu
a
;
ruggiu@dimeca.unica.it
;
Xianwen Kong
b
;
X.Kong@hw.ac.uk
关键词:
Mobility
;
Forward kinematics
;
Parallel manipulator with multiple operation modes
;
Singularity
刊名:Mechanism and Machine Theory
出版年:2012
8.
How obstructing is an obstacle? The influence of starting posture on obstacle avoidance
作者:
Rudmer Menger
;
Stefan Van der Stigchel
;
H. Chris Dijkerman
关键词:
Human experimental psychology (2300)
;
Visual perception (2323)
;
Motor processes (2330)
;
Attention (2346)
刊名:Acta Psychologica
出版年:2012
9.
Dexterous space optimization for robotic belt grinding
作者:
Dong Zhang
;
Chao Yun
;
Dezheng Song
关键词:
robot
;
kinematics
;
dexterity
;
optimization
;
Pattern search method
刊名:Procedia Engineering
出版年:2011
10.
Conceptual design and analysis of the 2T1R mechanism for a cooking robot
作者:
Bing Li
a
;
libing.sgs@hit.edu.cn
;
Yuan Chen
a
;
b
;
Zongquan Deng
c
;
denzq@hit.edu.cn
;
Wenfu Xu
a
[Author vitae]
关键词:
Parallel manipulator
;
Cooking process
;
Cooking robot
;
Conceptual design
刊名:Robotics and Autonomous Systems
出版年:2011
1
2
3
按检索点细分(27)
关键词(3)
文摘(25)
按出版年细分(27)
2027年及以后(3)
2017年(1)
2013年(1)
2012年(3)
2011年(4)
2009年(1)
2008年(1)
2006年(1)
2004年(2)
2003年(1)
2002年(2)
2000年(2)
2000年及以前(5)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.