设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(3)
在“
Elsevier电子期刊
”中,
命中:
19
条,耗时:小于0.01 秒
在所有数据库中总计命中:
3
条
1.
A polynomial-time algorithm for computing low CP-rank decompositions
作者:
Khaled
Elbassioni
k
elbassioni
@masdar.ac.ae" class="auth_mail" title="E-mail the corresponding author
;
Trung Thanh Nguyen
;
ttnguyen.cs@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Completely positive matrix
;
CP-rank
;
CP-decomposition
;
Polynomial-time algorithm
;
Computational complexity
刊名:Information Processing Letters
出版年:2017
2.
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
作者:
Endre Boros
a
;
boros@rutcor.rutgers.edu
;
Khaled
Elbassioni
b
;
elbassio@mpi-inf.mpg.de
;
k
elbassioni
@masdar.ac.ae
;
Vladimir Gurvich
a
;
gurvich@rutcor.rutgers.edu
;
Kazuhisa Makino
c
;
makino@kurims.kyoto-u.ac.jp
关键词:
Markov decision processes
;
Zero-sum stochastic games
;
Discounted stochastic games
;
Pseudo-polynomial algorithms
;
Saddle point
刊名:Operations Research Letters
出版年:2013
3.
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like -person games
作者:
Endre Boros
a
;
boros@rutcor.rutgers.edu
;
Khaled
Elbassioni
b
;
elbassio@mpi-sb.mpg.de
;
Vladimir Gurvich
a
;
gurvich@rutcor.rutgers.edu
;
Kazuhisa Makino
c
;
makino@mist.i.u-tokyo.ac.jp
关键词:
Chess- and Backgammon-like games
;
Nash equilibrium
;
Subgame perfect
;
Improvement cycle
;
Best reply
;
Stochastic game
;
Perfect information
;
Position
;
Move
;
Random move
刊名:Discrete Mathematics
出版年:2012
4.
The relation of Connected Set Cover and Group Steiner Tree
作者:
Khaled
Elbassioni
a
;
1
;
elbassio@mpi-inf.mpg.de
;
Slobodan Jeli?
b
;
sjelic@mathos.hr
;
sljelic@gmail.com
;
Domagoj Matijevi?
c
;
2
;
domagoj@mathos.hr
关键词:
Set cover
;
Connected set cover
;
Weighted connected set cover
;
Group Steiner tree
;
Node weighted group Steiner tree
;
Covering Steiner tree problem
刊名:Theoretical Computer Science
出版年:2012
5.
On the complexity of the highway problem
作者:
Khaled
Elbassioni
;
Rajiv Raman
;
Saurabh Ray
;
Ren¨¦ Sitters
关键词:
Complexity
;
NP-hardness
;
Hardness of approximation
;
Approximation algorithms
;
Pricing
;
Interval graphs
刊名:Theoretical Computer Science
出版年:2012
6.
Complexity of approximating the vertex centroid of a polyhedron
作者:
Khaled
Elbassioni
a
;
elbassio@mpi-inf.mpg.de
;
Hans Raj Tiwary
b
;
hans.raj.tiwary@ulb.ac.be
刊名:Theoretical Computer Science
出版年:2012
7.
On a cone covering problem
作者:
Khaled
Elbassioni
;
Hans Raj Tiwary
关键词:
Convexity testing
;
Union
;
Polyhedral cones
;
Vertex enumeration
刊名:Computational Geometry
出版年:2011
8.
Polynomial-time dualization of
r
-exact hypergraphs with applications in geometry
作者:
Khaled
Elbassioni
;
Imran Rauf
关键词:
Hypergraphs
;
Transversals
;
Geometric hitting sets
;
Enumeration algorithms
刊名:Discrete Mathematics
出版年:2010
9.
On effectivity functions of game forms
作者:
Endre Boros
;
Khaled
Elbassioni
;
Vladimir Gurvich
;
Kazuhisa Makino
关键词:
Game form
;
Tight
;
Totally tight
;
Effectivity function
;
Monotone
;
Superadditive
;
Weakly superadditive
;
Dual-minor
;
Self-dual
刊名:Games and Economic Behavior
出版年:2010
10.
On the complexity of monotone dualization and generating minimal hypergraph transversals
作者:
Khaled
M.
Elbassioni
关键词:
Dualization
;
Hypergraph transversals
;
Generation algorithms
;
Monotone Boolean functions
;
Polynomial space
刊名:Discrete Applied Mathematics
出版年:2008
1
2
按检索点细分(19)
作者(19)
按出版年细分(19)
2017年(1)
2013年(1)
2012年(4)
2011年(1)
2010年(2)
2008年(4)
2007年(4)
2006年(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
.