咨询与建议

限定检索结果

文献类型

  • 115 篇 期刊文献
  • 16 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 91 篇 工学
    • 70 篇 计算机科学与技术...
    • 22 篇 电气工程
    • 18 篇 软件工程
    • 8 篇 信息与通信工程
    • 5 篇 电子科学与技术(可...
    • 2 篇 机械工程
    • 2 篇 控制科学与工程
    • 2 篇 生物工程
  • 82 篇 理学
    • 74 篇 数学
    • 7 篇 生物学
    • 5 篇 统计学(可授理学、...
    • 1 篇 物理学
  • 36 篇 管理学
    • 36 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 4 篇 经济学
    • 3 篇 应用经济学
    • 1 篇 理论经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 医学

主题

  • 132 篇 polynomial-time ...
  • 14 篇 computational co...
  • 13 篇 np-completeness
  • 10 篇 linear programmi...
  • 7 篇 scheduling
  • 4 篇 graph algorithms
  • 4 篇 ellipsoid method
  • 4 篇 strong perfect g...
  • 4 篇 preemptive sched...
  • 4 篇 dynamic programm...
  • 3 篇 routing
  • 3 篇 np-hard
  • 3 篇 interior-point m...
  • 3 篇 spectrum-efficie...
  • 3 篇 simple paths
  • 3 篇 coloring
  • 3 篇 labeled directed...
  • 3 篇 combinatorial re...
  • 3 篇 algebraic number...
  • 3 篇 regular expressi...

机构

  • 4 篇 univ sharjah dep...
  • 4 篇 new jersey inst ...
  • 4 篇 nankai univ coll...
  • 3 篇 univ bergen dept...
  • 2 篇 ist austria klos...
  • 2 篇 univ vienna fac ...
  • 2 篇 univ pompeu fabr...
  • 2 篇 1.department of ...
  • 2 篇 univ warsaw inst...
  • 2 篇 zhengzhou univ s...
  • 2 篇 univ montpellier...
  • 2 篇 department of ci...
  • 2 篇 ntt corp 3-9-11 ...
  • 2 篇 univ ghent dept ...
  • 2 篇 columbia univ de...
  • 2 篇 sobolev inst mat...
  • 2 篇 univ cape town d...
  • 2 篇 kyoto univ grad ...
  • 2 篇 univ montpellier...
  • 2 篇 kyoto univ acad ...

作者

  • 4 篇 watanabe t
  • 4 篇 adler i
  • 4 篇 huang shenwei
  • 4 篇 jones mark
  • 4 篇 saad mohamed
  • 4 篇 scornavacca celi...
  • 3 篇 heggernes pinar
  • 3 篇 suzuki akira
  • 3 篇 beling pa
  • 3 篇 miyazaki shuichi
  • 3 篇 paul christophe
  • 3 篇 padberg m
  • 2 篇 monteiro rdc
  • 2 篇 yuan jinjiang
  • 2 篇 okamoto kazuya
  • 2 篇 hamada koki
  • 2 篇 varvarigou ta
  • 2 篇 xia wen
  • 2 篇 leung joseph y. ...
  • 2 篇 meister daniel

语言

  • 119 篇 英文
  • 13 篇 其他
检索条件"主题词=polynomial-time algorithms"
132 条 记 录,以下是61-70 订阅
排序:
Phylogeny- and parsimony-based haplotype inference with constraints
收藏 引用
INFORMATION AND COMPUTATION 2012年 213卷 33-47页
作者: Elberfeld, Michael Tantau, Till Univ Lubeck Inst Theoret Informat D-23538 Lubeck Germany
Haplotyping, also known as haplotype phase prediction, is the problem of predicting likely haplotypes based on genotype data. One fast computational haplotyping method is based on an evolutionary model where a perfect... 详细信息
来源: 评论
polynomial algorithms FOR LINEAR-PROGRAMMING OVER THE ALGEBRAIC-NUMBERS
收藏 引用
ALGORITHMICA 1994年 第6期12卷 436-457页
作者: ADLER, I BELING, PA UNIV VIRGINIA DEPT SYST ENGNCHARLOTTESVILLEVA 22903
We derive a bound on the computational complexity of linear programs whose coefficients are real algebraic numbers. Key to this result is a notion of problem size that is analogous in function to the binary size of a ... 详细信息
来源: 评论
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
收藏 引用
ALGORITHMICA 2021年 第9期83卷 2678-2696页
作者: Hamada, Koki Miyazaki, Shuichi Okamoto, Kazuya NTT Corp 3-9-11 Midori Cho Musashino Tokyo 1808585 Japan Kyoto Univ Grad Sch Informat Sakyo Ku Kyoto 6068501 Japan Kyoto Univ Acad Ctr Comp & Media Studies Sakyo Ku Kyoto 6068501 Japan Kyoto Univ Hosp Div Med Informat Technol & Adm Planning 54 Kawaharacho Kyoto 6068507 Japan
In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings, where participants of each side are aligned on each of two parallel lines, and no two matching edges are allowed to cross each other. They de... 详细信息
来源: 评论
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
收藏 引用
DISCRETE APPLIED MATHEMATICS 2009年 第2期157卷 339-355页
作者: Kats, Vladimir Levner, Eugene Holon Inst Technol IL-58102 Holon Israel Inst Ind Math IL-84105 Beer Sheva Israel
In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to rind ... 详细信息
来源: 评论
Chinese Postman Problem on edge-colored multigraphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 第Part2期217卷 196-202页
作者: Gutin, Gregory Jones, Mark Sheng, Bin Wahlstrom, Magnus Yeo, Anders Royal Holloway Univ London Dept Comp Sci Egham TW20 0EX Surrey England Univ Southern Denmark Dept Math & Comp Sci Campusvey 55 DK-5230 Odense Denmark Univ Johannesburg Dept Math ZA-2006 Auckland Pk South Africa
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postma... 详细信息
来源: 评论
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
收藏 引用
JOURNAL OF SCHEDULING 2016年 第1期19卷 61-72页
作者: Dugarzhapov, Aldar Kononov, Alexander Novosibirsk State Univ Novosibirsk 630090 Russia Ecole Polytech Palaiseau France Sobolev Inst Math Novosibirsk Russia
In a so-called mixed-shop scheduling problem, the operations of some jobs have to be processed in a fixed order (as in the job-shop problem);the other ones can be processed in an arbitrary order (as in the open-shop p... 详细信息
来源: 评论
A pricing approach for bandwidth allocation in differentiated service networks
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2008年 第12期35卷 3769-3786页
作者: Guan, Yongpei Yang, Weilai Owen, Henry Blough, Douglas A. Univ Oklahoma Sch Ind Engn Norman OK 73019 USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA
We present a decentralized auction-based scheme for bandwidth allocation and pricing in a differentiated service-based network. Different classes of clients provide their own expected bandwidth price and required amou... 详细信息
来源: 评论
Optimal Selection of Line Extensions: Incorporating Operational, Financial, and Marketing Constraints
收藏 引用
IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT 2014年 第4期61卷 738-754页
作者: Mu, Liying Dawande, Milind Gavirneni, Srinagesh Sriskandarajah, Chelliah Univ Texas Dallas Naveen Jindal Sch Management Dallas TX 75080 USA Cornell Univ Johnson Sch Management Ithaca NY 14850 USA Texas A&M Univ Mays Business Sch College Stn TX 77843 USA
Line extensions-variants of existing products with new appearances, functions, or forms-constitute a significant fraction of products launched each year. While line extensions typically share components with existing ... 详细信息
来源: 评论
On the Elusiveness of Clusters
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2012年 第2期9卷 517-534页
作者: Kelk, Steven M. Scornavacca, Celine Van Iersel, Leo Maastricht Univ Dept Knowledge Engn DKE NL-6200 MD Maastricht Netherlands Univ Tubingen Ctr Bioinformat ZBIT D-72076 Tubingen Germany Univ Canterbury Dept Math & Stat Christchurch 1 New Zealand
Rooted phylogenetic networks are often used to represent conflicting phylogenetic signals. Given a set of clusters, a network is said to represent these clusters in the softwired sense if, for each cluster in the inpu... 详细信息
来源: 评论
A polynomial-time algorithm for Outerplanar Diameter Improvement
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2017年 89卷 315-327页
作者: Cohen, Nathann Goncalves, Daniel Kim, Eun Jung Paul, Christophe Sau, Ignasi Thilikos, Dimitrios M. Weller, Mathias CNRS LRI Orsay France CNRS LIRMM Montpellier France CNRS LAMSADE Paris France Comp Technol Inst & Press Diophantus Patras Greece Univ Athens Dept Math Athens Greece
The OUTERPLANAR DIAMETER IMPROVEMENT problem asks, given a graph G and an integer D, whether it is possible to add edges to G in a way that the resulting graph is outerplanar and has diameter at most D. We provide a d... 详细信息
来源: 评论