设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(1)
Springer电子图书(3)
CNKI学位论文(707)
CNKI期刊论文0611(3)
知网期刊论文(306)
在“
Elsevier电子期刊
”中,
命中:
391
条,耗时:0.01799 秒
在所有数据库中总计命中:
1,020
条
1.
Sparse
approximation
is provably hard under coherent dictionaries
作者:
A. Ç
;
ivril
;
ali.civril@antalya.edu.tr" class="auth_mail" title="E-mail the corresponding author
关键词:
Sparse
approximation
;
Complexity
;
PCP
;
Unique games
刊名:Journal
of
Computer and System Sciences
出版年:2017
2.
Hardness
of
crosstalk minimization in two-layer channel routing
作者:
Achira Pal (nee Biswas)
a
;
achira.pal@gmail.com
;
Atal Chaudhuri
a
;
atalc23@gmail.com
;
Rajat Kumar Pal
b
;
pal.rajatk@gmail.com
;
Alak Kumar Datta
c
;
alak.datta@visva-bharati.ac.in
关键词:
Approximation
algorithm
;
Channel routing problem
;
Crosstalk minimization
;
Doglegging
;
High-performance routing
;
NP-
hardness
刊名:Integration, the VLSI Journal
出版年:2017
3.
Combinatorial filter reduction: Special cases,
approximation
, and fixed-parameter tractability
作者:
Fatemeh Zahra Saberifar
a
;
fz.saberifar@aut.ac.ir
;
Ali Mohades
a
;
mohades@aut.ac.ir
;
Mohammadreza Razzazi
b
;
razzazi@aut.ac.ir
;
Jason M. O'Kane
c
;
jokane@cse.sc.edu
关键词:
Combinatorial filters
;
Reduction
;
Automata
;
Approximation
;
Fixed-parameter
刊名:Journal
of
Computer and System Sciences
出版年:2017
4.
Approximation
schemes for parallel machine scheduling with non-renewable resources
作者:
Pé
;
ter Gyö
;
rgyi
a
;
b
;
gyorgyi.peter@sztaki.mta.hu
;
Tamá
;
s Kis
;
b
;
kis.tamas@sztaki.mta.hu
;
kis.tamas@yahoo.com
关键词:
Scheduling
;
Parallel machines
;
Non-renewable resources
;
Approximation
schemes
刊名:European Journal
of
Operational Research
出版年:2017
5.
Improved and simplified inapproximability for k-means
作者:
Euiwoong Lee
1
;
Melanie Schmidt
;
2
;
melanie.schmidt@tu-dortmund.de
;
John Wright
3
关键词:
k-Means
;
Hardness
of
approximation
;
Clustering
;
Computational complexity
刊名:Information Processing Letters
出版年:2017
6.
Approximation
and
hardness
results for the maximum edge q-coloring problem
作者:
Anna Adamaszek
a
;
1
;
anad@di.ku.dk" class="auth_mail" title="E-mail the corresponding author
;
Alexandru Popa
b
;
alexpopa9@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Hardness
of
approximation
;
Approximation
algorithms
;
Graph coloring
刊名:Journal
of
Discrete Algorithms
出版年:2016
7.
Finding large degree-anonymous subgraphs is hard
作者:
Cristina Bazgan
a
;
1
;
bazgan@lamsade.dauphine.fr" class="auth_mail" title="E-mail the corresponding author
;
Robert Bredereck
b
;
2
;
robert.bredereck@tu-berlin.de" class="auth_mail" title="E-mail the corresponding author
;
Sepp Hartung
b
;
sepp.hartung@tu-berlin.de" class="auth_mail" title="E-mail the corresponding author
;
André
;
Nichterlein
b
;
andre.nichterlein@tu-berlin.de" class="auth_mail" title="E-mail the corresponding author
;
Gerhard J. Woeginger
c
;
3
;
gwoegi@win.tue.nl" class="auth_mail" title="E-mail the corresponding author
关键词:
NP-
hardness
;
Approximation
-
hardness
;
W-
hardness
;
Graph algorithms
刊名:Theoretical Computer Science
出版年:2016
8.
First-principle investigations
of
structure, elastic and bond
hardness
of
Fe
x
B (x=1, 2, 3) under pressure
作者:
Ahmed Gueddouh
a
;
b
;
a.gueddouh@mail.lagh-univ.dz" class="auth_mail" title="E-mail the corresponding author
;
gueddouh_a@yahoo.fr" class="auth_mail" title="E-mail the corresponding author
;
Bachir Bentria
a
;
I.K. Lefkaier
a
关键词:
DFT
;
Magnetic moment
;
Mulliken population
;
Elastic constants
;
Hardness
;
Pressure effect
刊名:Journal
of
Magnetism and Magnetic Materials
出版年:2016
9.
Traveling salesman problems in temporal graphs
作者:
Othon Michail
a
;
michailo@cti.gr" class="auth_mail" title="E-mail the corresponding author
;
Paul G. Spirakis
a
;
b
;
P.Spirakis@liverpool.ac.uk" class="auth_mail" title="E-mail the corresponding author
关键词:
Dynamic network
;
Exploration
;
TSP with costs one and two
;
Temporal matching
;
Approximation
algorithm
;
Hardness
result
刊名:Theoretical Computer Science
出版年:2016
10.
Capacitated Max-Batching with interval graph compatibilities
作者:
Tim Nonner
tim@nonner.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Graph algorithms
;
Approximation
algorithms
;
Scheduling
;
Approximation
schemes
;
NP-
hardness
刊名:Theoretical Computer Science
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(391)
题名(28)
关键词(100)
文摘(256)
按出版年细分(391)
2027年及以后(16)
2017年(5)
2016年(15)
2015年(6)
2013年(23)
2012年(34)
2011年(29)
2010年(32)
2009年(31)
2008年(35)
2007年(20)
2006年(19)
2005年(19)
2004年(22)
2003年(15)
2002年(13)
2001年(12)
2000年(2)
2000年及以前(43)
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
.