设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(26)
Elsevier电子期刊(16)
在“
Elsevier电子期刊
”中,
命中:
16
条,耗时:0.0589711 秒
在所有数据库中总计命中:
42
条
1.
Graph-based approaches to debugging and revision of terminologies in DL-Lite
作者:
Xuefeng Fu
fxf@seu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Guilin Qi
;
gqi@seu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
fxfcn@126.com" class="auth_mail" title="E-mail the corresponding author
;
Yong Zhang
zhangyong@seu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Zhangquan Zhou
quanzz@seu.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
DL-Lite
;
Ontology debugging
;
Ontology revision
;
Scoring function
;
Hitting
set
tree
刊名:Knowledge-Based Systems
出版年:2016
2.
Forgetting for distance-based reasoning and repair in DL-Lite
作者:
Xiaowang Zhang
;
a
;
b
;
xiaowangzhang@tju.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Semantic Web
;
Description logics
;
Knowledge management
;
Distance-based semantics
;
Ontology reasoning
刊名:Knowledge-Based Systems
出版年:2016
3.
A branch-and-price-and-cut method for computing an optimal bramble
作者:
Sibel B. Sonuc
a
;
1
;
sibel.sonuc@ozyegin.edu.tr" class="auth_mail" title="E-mail the corresponding author
;
J. Cole Smith
b
;
jcsmith@clemson.edu" class="auth_mail" title="E-mail the corresponding author
;
Illya V. Hicks
c
;
2
;
ivhicks@rice.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Bramble
;
Branch-and-price
;
Tree
width
;
Integer programming
刊名:Discrete Optimization
出版年:2015
4.
Clustering with a new distance measure based on a dual-rooted
tree
作者:
Laurent Galluccio
;
Olivier Michel
;
Pierre Comon
;
Mark Kliger
;
Alfred O. Hero
关键词:
Non-metric clustering
;
Minimal spanning
tree
;
Prim&rsquo
;
s algorithm
;
Affinity measure
;
Co-association measure
;
Consensus clustering
刊名:Information Sciences
出版年:2013
5.
Dirichlet forms and associated heat kernels on the Cantor
set
induced by random walks on
tree
s
作者:
Jun Kigami
关键词:
Tree
;
Random walk
;
Martin boundary
;
Cantor
set
;
Dirichlet form
;
Heat kernel
刊名:Advances in Mathematics
出版年:2010
6.
Effect of canopy interception on spatial variability and isotopic composition of throughfall in Japanese cypress plantations
作者:
Hiroaki Kato
;
Yuichi Onda
;
Kazuki Nanko
;
Takashi Gomi
;
Tsutomu Yamanaka
;
Shimpei Kawaguchi
关键词:
Throughfall
;
Forest canopy
;
Rainfall redistribution
;
Isotopic analysis
;
Japanese cypress forest
刊名:Journal of Hydrology
出版年:11 November, 2013
7.
Parameterized algorithms for
d
-
Hitting
Set
: The weighted case
作者:
Henning Fernau
关键词:
Hitting
set
problems
;
Parameterized algorithms
;
Search
tree
algorithms
刊名:Theoretical Computer Science
出版年:2010
8.
Constructing credit auditing and control & management model with data mining technique
作者:
S.C. Chen
;
a
;
scchen@chinyi.ncut.edu.tw
;
M.Y. Huang
a
关键词:
CRISP-DM model
;
Credit card
;
Data mining
;
Artificial neural network (ANN)
;
Decision
tree
刊名:Expert Systems with Applications
出版年:2011
9.
Dynamic theorem proving algorithm for consistency-based diagnosis
作者:
Li-Ming Zhang
a
;
b
;
Hai-Lin Zeng
a
;
b
;
Fang-Yang
a
;
b
;
Dan-Tong Ouyang
a
;
b
;
ouyangdantong@163.com
关键词:
Satisfiability
;
Model-based diagnosis
;
Dynamic algorithm
;
Conjunctive normal form
刊名:Expert Systems with Applications
出版年:2011
10.
Expediating IP lookups with reduced power via TBM and SST supernode caching
作者:
Ying Zhang
;
Lu Peng
;
Wencheng Lu
;
Lide Duan
;
Suresh Rai
关键词:
Tree
bitmap (TBM)
;
Shape shifting trie (SST)
;
IP lookup
;
Supernode
;
Caching
刊名:Computer Communications
出版年:2010
1
2
按检索点细分(16)
关键词(3)
文摘(15)
按出版年细分(16)
2016年(2)
2015年(1)
2013年(1)
2011年(2)
2010年(3)
2008年(1)
2006年(1)
2003年(1)
2001年(2)
2000年及以前(2)
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
.