设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(6)
CNKI学位论文(35)
知网期刊论文(13)
在“
Elsevier电子期刊
”中,
命中:
79
条,耗时:0.0229875 秒
在所有数据库中总计命中:
54
条
1.
Totally optimal decision trees for
Boolean
functions
作者:
Igor Chikalov
;
Shahid Hussain
;
shahid.hussain@kaust.edu.sa" class="auth_mail" title="E-mail the corresponding author
;
Mikhail Moshkov
关键词:
Boolean
functions
;
Monotone
Boolean
functions
;
Totally optimal decision trees
;
Time complexity
;
Space complexity
刊名:Discrete Applied Mathematics
出版年:2016
2.
Multi- and multi-polar capacities
作者:
Andrea Mesiarová
;
-Zemá
;
nková
;
;
zemankova@mat.savba.sk" class="auth_mail" title="E-mail the corresponding author
;
Marek Hyčko
hycko@mat.savba.sk" class="auth_mail" title="E-mail the corresponding author
关键词:
Multi-polar aggregation
;
Boolean
function
;
Capacity
;
Bi-capacity
;
Bipolar capacity
;
Bi-cooperative game
;
Generalized bipolar capacity
刊名:Fuzzy Sets and Systems
出版年:2016
3.
Counting inequivalent
monotone
Boolean
functions
作者:
Tamon Stephen
;
tamon@sfu.ca" class="auth_mail
;
Timothy Yusun
tyusun@sfu.ca" class="auth_mail
关键词:
Dedekind numbers
;
Monotone
Boolean
functions
;
Isotone
Boolean
functions
;
Inequivalent
monotone
Boolean
functions
刊名:Discrete Applied Mathematics
出版年:20 April, 2014
4.
Totally Optimal Decision Trees for
Monotone
Boolean
Functions
with at Most Five Variables
作者:
Igor Chikalov
;
Shahid Hussain
;
Mikhail Moshkov
关键词:
Totally optimal decision trees
;
monotone
Boolean
functions
;
number of nodes and depth of decision trees
刊名:Procedia Computer Science
出版年:2013
5.
A functional completeness theorem for De Morgan
functions
作者:
Yu.M. Movsisyan
;
V.A. Aslanyan
关键词:
Antichain
;
De Morgan function
;
Monotone
Boolean
function
;
Disjunctive (conjunctive) normal form of De Morgan function
;
Closed class
;
Complete and precomplete classes
;
Quasi
monotone
and zigzag De Morgan
functions
刊名:Discrete Applied Mathematics
出版年:10 January, 2014
6.
Diagnosis of constant faults in iteration-free circuits over
monotone
basis
作者:
Saad Alrawaf
;
Igor Chikalov
;
Shahid Hussain
;
Mikhail Moshkov
关键词:
Monotone
Boolean
functions
;
Iteration-free circuits
;
Constant faults
;
Decision trees
刊名:Discrete Applied Mathematics
出版年:31 March, 2014
7.
A
Boolean
theory of signatures for tonal scales
作者:
B. Simeone
;
G. Nouno
;
M. Mezzadri
;
I. Lari
关键词:
Set covering
;
Boolean
functions
;
Musical composition
;
Musical improvisation
;
Tonal signatures
;
Boolean
signatures
刊名:Discrete Applied Mathematics
出版年:11 March, 2014
8.
Locally
monotone
Boolean
and pseudo-Boolean
functions
作者:
Miguel Couceiro
a
;
miguel.couceiro@uni.lu
;
Jean-Luc Marichal
a
;
jean-luc.marichal@uni.lu
;
Tamá
;
s Waldhauser
a
;
b
;
twaldha@math.u-szeged.hu
关键词:
Boolean
function
;
Pseudo-
Boolean
function
;
Local monotonicity
;
Discrete partial derivative
;
Join and meet derivatives
刊名:Discrete Applied Mathematics
出版年:2012
9.
Observables on quantum structures
作者:
Anatolij Dvure膷enskij
;
M谩ria Kukov谩
关键词:
Effect algebra
;
Observable
;
Monotone
蟽-completeness
;
Loomis&ndash
;
Sikorski Theorem
;
Effect-tribe
;
Riesz Decomposition Property
刊名:Information Sciences
出版年:20 March, 2014
10.
Size–energy tradeoffs for unate circuits computing symmetric
Boolean
functions
作者:
Kei Uchizawa
a
;
uchizawa@ecei.tohoku.ac.jp
;
Eiji Takimoto
b
;
eiji@i.kyushu-u.ac.jp
;
Takao Nishizeki
c
;
nishi@kwansei.ac.jp
关键词:
Energy complexity
;
Parity function
;
Size–
;
energy tradeoff
;
Symmetric
Boolean
functions
;
Threshold circuits
;
Unate circuits
刊名:Theoretical Computer Science
出版年:2011
1
2
3
4
5
6
7
8
按检索点细分(79)
题名(19)
关键词(20)
文摘(52)
按出版年细分(79)
2027年及以后(1)
2016年(2)
2013年(2)
2012年(3)
2011年(3)
2010年(3)
2009年(4)
2008年(6)
2007年(5)
2006年(6)
2005年(2)
2004年(5)
2003年(2)
2002年(4)
2001年(3)
2000年(3)
2000年及以前(25)
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
.