咨询与建议

限定检索结果

文献类型

  • 385 篇 期刊文献
  • 27 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 413 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 300 篇 理学
    • 294 篇 数学
    • 12 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
  • 184 篇 工学
    • 123 篇 计算机科学与技术...
    • 44 篇 软件工程
    • 25 篇 控制科学与工程
    • 17 篇 电气工程
    • 13 篇 机械工程
    • 7 篇 信息与通信工程
    • 5 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 电子科学与技术(可...
    • 3 篇 石油与天然气工程
    • 2 篇 化学工程与技术
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 150 篇 管理学
    • 149 篇 管理科学与工程(可...
    • 15 篇 工商管理
  • 16 篇 经济学
    • 13 篇 应用经济学
    • 3 篇 理论经济学
  • 7 篇 教育学
    • 7 篇 心理学(可授教育学...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 413 篇 polynomial algor...
  • 36 篇 complexity
  • 27 篇 scheduling
  • 17 篇 np-completeness
  • 15 篇 linear programmi...
  • 13 篇 dynamic programm...
  • 12 篇 np-complete
  • 11 篇 computational co...
  • 10 篇 stable set
  • 10 篇 combinatorial op...
  • 10 篇 kernel function
  • 9 篇 np-hardness
  • 8 篇 graph
  • 8 篇 matching
  • 8 篇 tree
  • 7 篇 graphs
  • 6 篇 longest path pro...
  • 6 篇 interior-point m...
  • 6 篇 independent set
  • 6 篇 hamiltonian cycl...

机构

  • 9 篇 univ southern de...
  • 8 篇 rutgers state un...
  • 8 篇 pusan natl univ ...
  • 6 篇 dongseo univ dep...
  • 5 篇 univ so denmark ...
  • 5 篇 univ southern de...
  • 5 篇 univ toronto div...
  • 5 篇 univ nizhny novg...
  • 4 篇 univ paris 09 la...
  • 4 篇 inst engn cybern...
  • 4 篇 kyoto univ grad ...
  • 4 篇 univ johannesbur...
  • 4 篇 belarusian state...
  • 4 篇 univ ioannina de...
  • 3 篇 beijing inst tec...
  • 3 篇 odense univ dept...
  • 3 篇 moscow mv lomono...
  • 3 篇 lomonosov moscow...
  • 3 篇 univ primorska u...
  • 3 篇 eotvos lorand un...

作者

  • 13 篇 lozin vv
  • 11 篇 bang-jensen jorg...
  • 9 篇 nagamochi h
  • 8 篇 mertzios george ...
  • 8 篇 cho gyeong-mi
  • 7 篇 ibaraki t
  • 7 篇 hansen p
  • 6 篇 averbakh igor
  • 6 篇 jaumard b
  • 6 篇 bang-jensen j.
  • 6 篇 bang-jensen j
  • 6 篇 gerber mu
  • 5 篇 hertz a
  • 5 篇 averbakh i
  • 5 篇 levner eugene
  • 5 篇 yeo anders
  • 5 篇 woeginger gj
  • 4 篇 tao yuegang
  • 4 篇 tuza z
  • 4 篇 chu chengbin

语言

  • 333 篇 英文
  • 78 篇 其他
  • 2 篇 中文
检索条件"主题词=polynomial algorithm"
413 条 记 录,以下是51-60 订阅
排序:
The pairwise flowtime network construction problem
收藏 引用
OPERATIONS RESEARCH LETTERS 2021年 第6期49卷 902-907页
作者: Averbakh, Igor Univ Toronto Scarborough Dept Management 1265 Mil Trail Toronto ON M1C 1A4 Canada Univ Toronto Rotman Sch Management 105 St George St Toronto ON M5S 3E6 Canada
It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere i... 详细信息
来源: 评论
Fast algorithm for Cyber-Attack Estimation and Attack Path Extraction Using Attack Graphs with AND/OR Nodes
收藏 引用
algorithmS 2024年 第11期17卷 504-504页
作者: Levner, Eugene Tsadikovich, Dmitry Holon Inst Technol Fac Sci IL-58102 Holon Israel Bar Ilan Univ Dept Management IL-5290002 Ramat Gan Israel
This paper studies the security issues for cyber-physical systems, aimed at countering potential malicious cyber-attacks. The main focus is on solving the problem of extracting the most vulnerable attack path in a kno... 详细信息
来源: 评论
Multiaffine polynomials over a finite field
收藏 引用
DISCRETE MATHEMATICS AND APPLICATIONS 2021年 第6期31卷 421-430页
作者: Selezneva, Svetlana N. Lomonosov Moscow State Univ Moscow Russia
We consider polynomials f (x(1),..., x(n)) over a finite field that possess the following property: for some element b of the field the set of solutions of the equation f (x1,..., x(n)) = b coincides with the set of s... 详细信息
来源: 评论
polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form
收藏 引用
PROBLEMS OF INFORMATION TRANSMISSION 2020年 第4期56卷 373-387页
作者: Sholomov, L. A. Russian Acad Sci Fed Res Ctr Comp Sci & Control Moscow Russia Russian Acad Sci Inst Syst Anal Moscow Russia
An underdetermined Bernoulli source generates symbols of a given underdetermined alphabet independently with some probabilities. To each underdetermined symbol there corresponds a set of basic (fully defined) symbols ... 详细信息
来源: 评论
A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2013年 第1期64卷 200-210页
作者: Chu, Chengbin Chu, Feng Zhong, Jinhong Yang, Shanlin Tongji Univ Sch Econ & Management Shanghai Peoples R China Ecole Cent Paris Lab Genie Ind Paris France Univ Eviy Val dEssone Lab IBISC Evry France Hefei Univ Technol Sch Management Hefei Peoples R China
This paper addresses a real-life production planning problem arising in a manufacturer of luxury goods. This problem can be modeled as a single item dynamic lot-sizing model with backlogging, outsourcing and inventory... 详细信息
来源: 评论
The Implementation of Eulerian Coverings of a Graph for Solving Routing Problems
The Implementation of Eulerian Coverings of a Graph for Solv...
收藏 引用
International-Federation-of-Information-Processing-Working-Group-5.7 (IFIP WG 5.7) International Conference on Advances in Production Management Systems (APMS)
作者: Makarovskikh, Tatiana A. South Ural State Univ 76 Lenin Ave Chelyabinsk 454080 Russia
In terms of graph theory, the urban transport network can be adequately represented as a graph. All crossroads in the city are considered to be the vertices of the graph, and streets are the edges. Using this model, o... 详细信息
来源: 评论
Minimal size balanced sets mod p
收藏 引用
SCIENTIFIC AFRICAN 2024年 25卷
作者: Cuong, Nguyen Phu Nedev, Zhivko P. Zungeru, Adamu Murtala Dalhousie Univ Halifax NS Canada Botswana Int Univ Sci & Technol Dept Comp Sci P Bag 0016 Palapye Botswana Botswana Int Univ Sci & Technol Dept Elect Comp & Telecommun Engn P Bag 0016 Palapye Botswana
A nonempty set.. of residues modulo.. is said to be balanced if for each....., there is a.. with 0 1. Thus, the sequence simplifies to.... = 2.. + 1 3 with.. odd. Finally, we prove that if 2.. + 1 3 is prime, then.. ... 详细信息
来源: 评论
Maximum independent sets in subcubic graphs: New results
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 846卷 14-26页
作者: Harutyunyan, A. Lampis, M. Lozin, V Monnot, J. Univ Paris 09 Univ PSL CNRS LAMSADE F-75016 Paris France Univ Warwick Math Inst Coventry CV4 7AL W Midlands England
The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We study complexity of the problem on hereditary subclasses of subcubic graphs. Each ... 详细信息
来源: 评论
Geometric algorithms for Finding a Point in the Intersection of Balls
收藏 引用
AUTOMATION AND REMOTE CONTROL 2020年 第5期81卷 869-882页
作者: Lushchakova, I. N. Belarusian State Univ Informat & Radioelect Minsk BELARUS
We consider a problem of finding a point in the intersection of n balls in the Euclidean space E-m. For the case m = 2 we suggest two algorithms of the complexity O(n(2) log n) and O(n(3)) operations, respectively. Fo... 详细信息
来源: 评论
Weak Coverage of a Rectangular Barrier
收藏 引用
algorithmICA 2020年 第4期82卷 721-746页
作者: Dobrev, Stefan Kranakis, Evangelos Krizanc, Danny Lafond, Manuel Manuch, Jan Narayanan, Lata Opatrny, Jaroslav Stacho, Ladislav Slovak Acad Sci Inst Math Bratislava Slovakia Carleton Univ Sch Comp Sci Ottawa ON Canada Wesleyan Univ Dept Math & Comp Sci Middletown CT USA Univ Ottawa Dept Math & Stat Ottawa ON Canada Univ British Columbia Dept Comp Sci Vancouver BC Canada Concordia Univ Dept Comp Sci & Software Engn Montreal PQ Canada Simon Fraser Univ Dept Math Burnaby BC Canada
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. Each sensor can monitor a circular area of specific diameter around its position, called the sensor diameter. Senso... 详细信息
来源: 评论