咨询与建议

限定检索结果

文献类型

  • 298 篇 期刊文献
  • 55 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 234 篇 工学
    • 180 篇 计算机科学与技术...
    • 32 篇 电气工程
    • 20 篇 软件工程
    • 15 篇 机械工程
    • 15 篇 信息与通信工程
    • 12 篇 生物工程
    • 10 篇 控制科学与工程
    • 10 篇 交通运输工程
    • 8 篇 电子科学与技术(可...
    • 6 篇 土木工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 光学工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 农业工程
  • 169 篇 理学
    • 143 篇 数学
    • 16 篇 生物学
    • 12 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 3 篇 化学
    • 1 篇 系统科学
  • 138 篇 管理学
    • 138 篇 管理科学与工程(可...
    • 20 篇 工商管理
  • 29 篇 经济学
    • 23 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 医学
  • 2 篇 法学
    • 2 篇 社会学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
    • 1 篇 作物学
  • 1 篇 军事学

主题

  • 355 篇 exact algorithm
  • 21 篇 dynamic programm...
  • 12 篇 combinatorial op...
  • 11 篇 approximation al...
  • 10 篇 fixed-parameter ...
  • 9 篇 computational ge...
  • 9 篇 heuristics
  • 9 篇 branch-and-bound
  • 8 篇 optimization
  • 8 篇 scheduling
  • 7 篇 np-hard
  • 7 篇 np-hard problem
  • 7 篇 approximate algo...
  • 7 篇 heuristic
  • 7 篇 shortest path
  • 7 篇 satisfiability
  • 7 篇 complexity
  • 7 篇 knapsack problem
  • 6 篇 routing
  • 6 篇 independent set

机构

  • 9 篇 kyonggi univ dep...
  • 8 篇 univ elect sci &...
  • 5 篇 sobolev inst mat...
  • 5 篇 nanjing univ sch...
  • 5 篇 dongbei univ fin...
  • 4 篇 natl univ singap...
  • 4 篇 northeastern uni...
  • 4 篇 univ laval canad...
  • 4 篇 kyoto univ dept ...
  • 4 篇 univ cologne ins...
  • 3 篇 univ alberta dep...
  • 3 篇 kyoto univ grad ...
  • 3 篇 texas a&m univ d...
  • 3 篇 univ laval cirre...
  • 3 篇 univ jena inst i...
  • 3 篇 novosibirsk stat...
  • 3 篇 postech dept com...
  • 3 篇 cent south univ ...
  • 3 篇 kobe univ grad s...
  • 3 篇 kyonggi univ div...

作者

  • 12 篇 bae sang won
  • 7 篇 yu yang
  • 7 篇 xiao mingyu
  • 6 篇 coelho leandro c...
  • 6 篇 tang jiafu
  • 6 篇 saurabh saket
  • 5 篇 okamoto yoshio
  • 5 篇 tanaka shunji
  • 4 篇 laporte gilbert
  • 4 篇 lim andrew
  • 4 篇 yamaguchi kazuak...
  • 4 篇 masuda sumio
  • 4 篇 sun wei
  • 4 篇 nagamochi hirosh...
  • 4 篇 rajasekaran sang...
  • 4 篇 lin guohui
  • 4 篇 seto kazuhisa
  • 4 篇 niedermeier rolf
  • 4 篇 wang junwei
  • 4 篇 wei lijun

语言

  • 314 篇 英文
  • 38 篇 其他
  • 1 篇 中文
检索条件"主题词=exact algorithm"
355 条 记 录,以下是131-140 订阅
排序:
Fast Recursive Computation of 3D Geometric Moments from Surface Meshes
收藏 引用
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2012年 第11期34卷 2158-2163页
作者: Koehl, Patrice Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Univ Calif Davis Genome Ctr Davis CA 95616 USA
A new exact algorithm is proposed to compute the 3D geometric moments of a homogeneous shape defined by an unstructured triangulation of its surface. This algorithm relies on the analytical integration of the moments ... 详细信息
来源: 评论
Bundling three convex polygons to minimize area or perimeter
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2016年 51卷 1-14页
作者: Park, Dongwoo Bae, Sang Won Alt, Helmut Ahn, Hee-Kap POSTECH Dept Comp Sci & Engn Pohang South Korea Kyonggi Univ Dept Comp Sci Suwon South Korea Free Univ Berlin Berlin Germany
Given three convex polygons having n vertices in total in the plane, we consider the problem of finding a translation for each polygon such that the translated polygons are pairwise disjoint and the area or the perime... 详细信息
来源: 评论
On the independent set problem in random graphs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2015年 第11期92卷 2233-2242页
作者: Song, Yinglei Jiangsu Univ Sci & Technol Sch Comp Sci & Engn Zhanjiang 212003 Jiangsu Peoples R China
In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph G, each pair of vertices are joined by an edge with a probability p, whe... 详细信息
来源: 评论
Complexity and algorithms for finding a subset of vectors with the longest sum
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 818卷 60-73页
作者: Shenmaier, Vladimir Sobolev Inst Math 4 Koptyug Ave Novosibirsk 630090 Russia
The problem is, given a set of n vectors in a d-dimensional normed space, find a subset with the largest length of the sum vector. We prove that, in the case of the lp norm, the problem is APX-complete for any p is an... 详细信息
来源: 评论
Combinatorial Benders' Cuts for the Strip Packing Problem
收藏 引用
OPERATIONS RESEARCH 2014年 第3期62卷 643-661页
作者: Cote, Jean-Francois Dell'Amico, Mauro Iori, Manuel Univ Laval CIRRELT Quebec City PQ G1V 0A6 Canada Univ Modena & Reggio Emilia DISMI I-42122 Reggio Emilia Italy
We study the strip packing problem, in which a set of two-dimensional rectangular items has to be packed in a rectangular strip of fixed width and infinite height, with the aim of minimizing the height used. The probl... 详细信息
来源: 评论
A simple and fast heuristic for protein structure comparison
收藏 引用
BMC BIOINFORMATICS 2008年 第1期9卷 1-16页
作者: Pelta, David A. Gonzalez, Juan R. Vega, Marcos Moreno Univ Granada Dept Comp Sci & Artificial Intelligence Models Decis & Optimizat Res Grp E-18071 Granada Spain Univ La Laguna Dept Stat Operat Res & Computat DEIOC E-38207 San Cristobal la Laguna Spain
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Map Overlap problem (MAX-CMO) one of the... 详细信息
来源: 评论
The minimum weight triangulation problem with few inner points
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2006年 第3期34卷 149-158页
作者: Hoffmann, Michael Okamoto, Yoshio Toyohashi Univ Technol Dept Informat & Comp Sci Tempa Ku Aichi 4418580 Japan Swiss Fed Inst Technol Inst Theoret Comp Sci CH-8092 Zurich Switzerland
We look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the interior of the convex hull). As a case... 详细信息
来源: 评论
Definition and algorithms for Reliable Steiner Tree Problem
收藏 引用
Journal of Systems Science & Complexity 2015年 第4期28卷 876-886页
作者: TANG Yaohua YANG Wenguo GUO Tiande School of Mathematics University of Chinese Academy of Sciences
This paper considers a new form of the Steiner tree problem that is more practical and reliable,which we call Reliable Steiner Tree(RST)*** authors give a detailed definition for this new problem and design both an ex... 详细信息
来源: 评论
Channel assignment via fast zeta transform
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第15期111卷 727-730页
作者: Cygan, Marek Kowalik, Lukasz Univ Warsaw Inst Informat PL-00325 Warsaw Poland
We show an 0*((l + 1)(n))-time algorithm for the channel assignment problem, where l is the maximum edge weight. This improves on the previous o*((l + 2)(n))-time algorithm by Kral (2005) [1], as well as algorithms fo... 详细信息
来源: 评论
On the parameterized complexity of b-CHROMATIC NUMBER
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2017年 84卷 120-131页
作者: Panolan, Fahad Philip, Geevarghese Saurabh, Saket HBNI Inst Math Sci Madras Tamil Nadu India Chennai Math Inst Madras Tamil Nadu India Univ Bergen Dept Informat N-5020 Bergen Norway
The b-chromatic number of a graph G, chi(b) (G), is the largest integer k such that G has a k-vertex coloring with the property that each color class has a vertex which is adjacent to at least one vertex in each of th... 详细信息
来源: 评论