设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(1)
SpringerLink电子期刊(55)
Elsevier电子期刊(44)
Springer电子图书(2)
ProQuest学位论文(12)
在“
Elsevier电子期刊
”中,
命中:
44
条,耗时:0.0419804 秒
在所有数据库中总计命中:
114
条
1.
Analyzing ultimate positivity for solvable systems
作者:
Ming Xu
a
;
b
;
mxu@cs.ecnu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Cheng-Chao Huang
b
;
ecnucchuang@126.com" class="auth_mail" title="E-mail the corresponding author
;
Zhi-Bin Li
c
;
lizb@cs.ecnu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Zhenbing Zeng
d
;
zbzeng@shu.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Positivity problem
;
Dynamical system
;
Decision
procedure
;
Computational algebraic geometry
;
Number
theory
刊名:Theoretical Computer Science
出版年:2016
2.
An
algorithmic
approach to identify irrelevant information in sequential teams
作者:
Aditya Mahajan
a
;
aditya.mahajan@mcgill.ca" class="auth_mail" title="E-mail the corresponding author
Author Vitae
;
Sekhar Tatikonda
b
;
sekhar.tatikonda@yale.edu" class="auth_mail" title="E-mail the corresponding author
Author Vitae
关键词:
Sequential teams
;
Decentralized stochastic control
;
Markov
decision
theory
;
Graphical models
;
Bayesian networks
刊名:Automatica
出版年:2015
3.
A game mechanism for single machine sequencing with zero risk
作者:
Mikhail Y. Kovalyov
;
Erwin Pesch
关键词:
Scheduling
;
Logistics
;
Game
theory
;
Algorithmic
mechanism design
刊名:Omega
出版年:April, 2014
4.
Algorithmic
aspects of mean-variance optimization in Markov
decision
processes
作者:
Shie Mannor
;
John N. Tsitsiklis
关键词:
Markov processes
;
Dynamic programming
;
Control
;
Complexity
theory
刊名:European Journal of Operational Research
出版年:2013
5.
Computing and visualizing banks sets of dominance relations using relation algebra and RelView
作者:
Rudolf Berghammer
;
rub@informatik.uni-kiel.de
关键词:
Relation algebra
;
Relation-algebraic specification
;
RelView tool
;
Social choice
theory
;
Dominance relation
;
Banks set
;
Binary
decision
diagram
刊名:Journal of Logic and Algebraic Programming
出版年:2013
6.
Two-player simultaneous location game: Preferential rights and overbidding
作者:
Pedro Godinho
a
;
pgodinho@fe.uc.pt
;
Joana Dias
b
;
joana@fe.uc.pt
关键词:
Location
;
Game
theory
;
Competitive location problems
;
Simultaneous
decision
s
;
Nash-equilibria
刊名:European Journal of Operational Research
出版年:2013
7.
Choquet optimal set in biobjective combinatorial optimization
作者:
Thibaut Lust
;
Antoine Roll
关键词:
Multiobjective optimization
;
Choquet integral
;
Algorithmic
decision
theory
;
Knapsack problem
;
Minimum spanning tree problem
刊名:Computers and Operations Research
出版年:2013
8.
Algorithmic
determination of the maximum possible earnings for investment strategies
作者:
Olivier Brandouy
a
;
olivier.brandouy@univ-paris1.fr
Author Vitae
;
Philippe Mathieu
b
Author Vitae
;
Iryna Veryzhenko
c
Author Vitae
关键词:
Optimization
;
Algorithm
;
Graph
;
Investment strategy
刊名:
Decision
Support Systems
出版年:2013
9.
Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks
作者:
Dariusz G?sior
;
Maciej Drwal
关键词:
Computer networks
;
Algorithmic
game
theory
;
Capacity allocation
刊名:Computer Networks
出版年:2013
10.
Computing rank dependent utility in graphical models for sequential
decision
problems
作者:
Gildas Jeantet
a
;
Olivier Spanjaard
;
a
;
olivier.spanjaard@lip6.fr
关键词:
Algorithmic
decision
theory
;
Rank dependent utility
;
Decision
trees
;
Influence diagrams
;
Planning under uncertainty
刊名:Artificial Intelligence
出版年:2011
1
2
3
4
5
按检索点细分(44)
关键词(2)
文摘(18)
按出版年细分(44)
2027年及以后(1)
2016年(1)
2015年(1)
2013年(6)
2012年(1)
2011年(7)
2010年(2)
2009年(2)
2008年(2)
2007年(1)
2006年(4)
2005年(3)
2004年(2)
2003年(2)
2002年(1)
2001年(2)
2000年(2)
2000年及以前(4)
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
.