设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
中国地质文献-英文(789)
SpringerLink电子期刊(162759)
GSW全文库(1081)
Wiley电子期刊(2781)
ProQuest学位论文(9065)
Elsevier电子期刊(329723)
Springer电子图书(1867)
NATURE电子期刊(8273)
ACS电子期刊(4080)
在“
SpringerLink电子期刊
”中,
命中:
162,759
条,耗时:小于0.01 秒
在所有数据库中总计命中:
520,418
条
1.
The influence of
object
similarity and orientation on
object
-based cueing
作者:
Elisabeth Hein
;
Stefan Blaschke
;
Bettina Rolke
关键词:
Visual perception
;
Object
;
based attention
;
Object
;
based cueing
;
Meridian effect
刊名:Attention, Perception, & Psychophysics
出版年:2017
2.
Multi-
object
ive ant lion optimizer: a multi-
object
ive optimization algorithm for solving engineering problems
作者:
Seyedali Mirjalili
;
Pradeep Jangir
;
Shahrzad Saremi
关键词:
Ant lion optimizer
;
Multi
;
object
ive optimization
;
Optimization
;
Evolutionary algorithm
;
Multi
;
criterion optimization
;
Heuristic
;
Algorithm
;
Meta
;
heuristic
;
Engineering optimization
刊名:Applied Intelligence
出版年:2017
3.
A comprehensive framework for modeling heterogeneous
object
s
作者:
Francisco Conde-Rodríguez
;
Juan-Carlos Torres…
关键词:
Object
modeling
;
Heterogeneous
object
s
;
Béziér
刊名:The Visual Computer
出版年:2017
4.
Formal Model of the Synthesized Screen Image of a Dynamic Situation in Areas of Monitoring Mobile
Object
s and its Implementation in a Web-Oriented Geoinformation System
作者:
A. M. Qasem
关键词:
web
;
oriented system for monitoring mobile
object
s
;
dynamic scene
;
cartographic background
;
symbol of a moving
object
;
layerwise visualization
;
context
;
MVC
;
client
;
server architecture
刊名:Cybernetics and Systems Analysis
出版年:2017
5.
Concept acquisition approach of
object
-oriented concept lattices
作者:
Jian-Min Ma
;
Ming-Jie Cai
;
Cun-Jun Zou
关键词:
Object
;
oriented concept lattice
;
Object
;
oriented attribute concept
;
Layered extension set
;
Concept acquirement approach
;
Concept acquirement algorithm
刊名:International Journal of Machine Learning and Cybernetics
出版年:2017
6.
A dynamic multi-
object
ive evolutionary algorithm using a change severity-based adaptive population management strategy
作者:
Radhia Azzouz
;
Slim Bechikh
;
Lamjed Ben Said
关键词:
Change severity sensing
;
Dynamic multi
;
object
ive optimization
;
Time
;
changing
object
ive functions
;
Adaptive population management
;
Memory
;
based strategy
;
Local search
;
based strategy
;
Change severity
;
based strategy
刊名:Soft Computing
出版年:2017
7.
An interactive satisficing approach for multi-
object
ive optimization with uncertain parameters
作者:
Shuya Zhong
;
Yizeng Chen
;
Jian Zhou
;
Yuanyuan Liu
关键词:
Multi
;
object
ive optimization
;
Multi
;
object
ive programming
;
Uncertain variable
;
Uncertain programming
;
Interactive satisficing approach
刊名:Journal of Intelligent Manufacturing
出版年:2017
8.
Automatically Configuring Multi-
object
ive Local Search Using Multi-
object
ive Optimisation
关键词:
Algorithm configuration
;
Multi
;
object
ive optimisation
;
Local search
;
Permutation flowshop scheduling
刊名:Lecture Notes in Computer Science
出版年:2017
9.
Object
tracking using combination of daubechies complex wavelet transform and Zernike moment
作者:
Manish Khare
;
Rajneesh Kumar Srivastava
;
Ashish Khare
关键词:
Object
tracking
;
Daubechies complex wavelet transform
;
Zernike moment
;
Shift
;
invariance
;
Translation and rotation invariance
刊名:Multimedia Tools and Applications
出版年:2017
10.
Solving the Bi-
object
ive Traveling Thief Problem with Multi-
object
ive Evolutionary Algorithms
关键词:
Traveling Thief Problem
;
Traveling Salesman Problem
;
Knapsack problem
;
Interwoven systems
;
Multi
;
object
ive optimization
;
Discrete optimization
;
Combinatoric problems
刊名:Lecture Notes in Computer Science
出版年:2017
1
2
3
4
5
6
7
8
9
查看站内搜索结果(1)
按检索点细分(162759)
题名(14245)
作者(3)
关键词(8475)
文摘(158975)
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
.