咨询与建议

限定检索结果

文献类型

  • 208 篇 期刊文献
  • 76 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 224 篇 工学
    • 141 篇 计算机科学与技术...
    • 64 篇 电气工程
    • 38 篇 信息与通信工程
    • 23 篇 控制科学与工程
    • 20 篇 软件工程
    • 15 篇 电子科学与技术(可...
    • 14 篇 机械工程
    • 7 篇 力学(可授工学、理...
    • 6 篇 材料科学与工程(可...
    • 6 篇 交通运输工程
    • 3 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 测绘科学与技术
    • 3 篇 化学工程与技术
    • 3 篇 航空宇航科学与技...
    • 2 篇 光学工程
    • 2 篇 土木工程
  • 100 篇 理学
    • 83 篇 数学
    • 5 篇 系统科学
    • 3 篇 物理学
    • 3 篇 大气科学
    • 3 篇 统计学(可授理学、...
    • 2 篇 地球物理学
    • 2 篇 生物学
  • 46 篇 管理学
    • 44 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 5 篇 经济学
    • 4 篇 应用经济学
  • 3 篇 农学
    • 2 篇 作物学
  • 3 篇 医学
    • 3 篇 临床医学
  • 2 篇 法学
  • 1 篇 军事学

主题

  • 284 篇 optimal algorith...
  • 13 篇 computational ge...
  • 13 篇 scheduling
  • 8 篇 dynamic programm...
  • 8 篇 parallel algorit...
  • 7 篇 makespan
  • 7 篇 genetic algorith...
  • 6 篇 parallel algorit...
  • 5 篇 computational co...
  • 5 篇 utility function...
  • 5 篇 complexity
  • 4 篇 multiple antenna
  • 4 篇 motion planning
  • 4 篇 proportional fai...
  • 4 篇 lower bound
  • 4 篇 tree
  • 4 篇 approximation al...
  • 4 篇 optimisation
  • 4 篇 facility locatio...
  • 4 篇 time complexity

机构

  • 3 篇 agh univ sci & t...
  • 3 篇 zhejiang univ de...
  • 3 篇 agh univ sci & t...
  • 3 篇 univ hong kong d...
  • 3 篇 capital normal u...
  • 2 篇 huaqiao univ col...
  • 2 篇 department of co...
  • 2 篇 pontificia univ ...
  • 2 篇 cnr isti i-56124...
  • 2 篇 the institute of...
  • 2 篇 tech univ carolo...
  • 2 篇 tech univ darmst...
  • 2 篇 univ reading dep...
  • 2 篇 russian acad sci...
  • 2 篇 qufu normal univ...
  • 2 篇 cent s univ sch ...
  • 2 篇 zhejiang univ ni...
  • 2 篇 fuzhou univ coll...
  • 2 篇 univ minnesota t...
  • 2 篇 univ pisa dipart...

作者

  • 5 篇 przybylowicz paw...
  • 4 篇 lau vkn
  • 4 篇 kim dong hwa
  • 4 篇 wood d
  • 3 篇 kacewicz b
  • 3 篇 itsykson dmitry
  • 3 篇 wei qi
  • 3 篇 cho jae hoon
  • 3 篇 wang heping
  • 3 篇 hirsch edward a.
  • 3 篇 kwok yk
  • 3 篇 sarrafzadeh m
  • 2 篇 高庆狮
  • 2 篇 guo longkun
  • 2 篇 gao zhenguo
  • 2 篇 natwichai juggap...
  • 2 篇 vanzanten aj
  • 2 篇 wang-hui
  • 2 篇 yan jt
  • 2 篇 wang kai

语言

  • 263 篇 英文
  • 17 篇 其他
  • 4 篇 中文
检索条件"主题词=optimal algorithm"
284 条 记 录,以下是221-230 订阅
排序:
An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing
收藏 引用
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1999年 第2期18卷 163-171页
作者: Yan, JT Natl Chiao Tung Univ Comp Syst Res Ctr Hsinchu 30050 Taiwan
It is well known that a non-Manhattan channel router always uses fewer routing tracks than a Manhattan router in a channel, To our knowledge, for a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, ... 详细信息
来源: 评论
A fast optimal non-continuous slot reuse scheme for CRMA high-speed networks
收藏 引用
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2001年 第2期17卷 217-228页
作者: Sheu, PR Lin, CM Natl Yunlin Univ Sci & Technol Dept Elect Engn Yunlin 640 Taiwan
Cyclic-Reservation Multiple-Access (CRMA) is an effective access scheme for hi h speed networks. In CRMA? the headend periodically generates reserve commands. If necessary, each station may reserve a number of empty s... 详细信息
来源: 评论
optimal conditional estimation: Average case setting
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2001年 第3期109卷 649-666页
作者: Kacewicz, B Univ Min & Met Dept Appl Math Krakow Poland
We consider an estimation problem which appears in the identification of systems by means of restricted complexity models: find the optimal approximation to an element of a linear normed space (a system) based on nois... 详细信息
来源: 评论
A generalized framework for iterative source-channel decoding
收藏 引用
ANNALS OF TELECOMMUNICATIONS 2001年 第7-8期56卷 435-446页
作者: Görtz, N Tech Univ Munich Inst Commun Engn D-80290 Munich Germany
Joint source-channel decoding is considered for a transmission system, in which the quantizer indices of several autocorrelated source signals are bit-interleaved, commonly channel encoded, and transmitted in parallel... 详细信息
来源: 评论
Matrix multiplication on the OTIS-Mesh optoelectronic computer
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 2001年 第7期50卷 635-646页
作者: Wang, CF Sahni, S So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA
We develop algorithms to multiply two vectors, a vector and a matrix, and two matrices on an OTIS-Mesh optoelectronic computer. Two mappings, group row and group submesh [25], of a matrix onto an OTIS-Mesh are conside... 详细信息
来源: 评论
optimal average case estimation in Hilbert norms
收藏 引用
MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS 2000年 第4期13卷 347-359页
作者: Kacewicz, B Stanislaw Staszic Univ Min & Met Dept Appl Math PL-30059 Krakow Poland
In contrast to the worst case approach, the average case setting provides less conservative insight into the quality of estimation algorithms. In this paper we consider two local average case error measures of algorit... 详细信息
来源: 评论
Hierarchical bubble-sorting-based non-Manhattan channel routing
收藏 引用
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 2000年 第4期147卷 215-220页
作者: Yan, JT Chung Hua Univ Dept Comp Sci & Informat Engn Hsinchu Taiwan
For a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chen's O(k(2)n) optimal algorithm and Yan's O(kn) optimal algorithm have been proposed respectively where n is the number of terminals... 详细信息
来源: 评论
An optimal algorithm for certain boundary value problem
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 1997年 第2期83卷 195-203页
作者: Stys, K Stys, T UNIV BOTSWANA & SWAZILAND DEPT MATHPRIVATE BAG 0022GABORONEBOTSWANA
The O(h(4)) finite-difference scheme for the second derivative u ''(x) leads to a coherent pentadiagonal matrix which is factorized into two tridiagonal matrices. This factorization is used to derive an optima... 详细信息
来源: 评论
An optimal algorithm for scanning all spanning trees of undirected graphs
收藏 引用
SIAM JOURNAL ON COMPUTING 1997年 第3期26卷 678-692页
作者: Shioura, A Tamura, A Uno, T UNIV ELECTROCOMMUN DEPT COMP SCI & INFORMAT MATHCHOFUTOKYO 182JAPAN TOKYO INST TECHNOL DEPT SYST SCIMEGURO KUTOKYO 152JAPAN
Let G be an undirected graph with V vertices and E edges. Many algorithms have been developed for enumerating all spanning trees in G. Most of the early algorithms use a technique called ''backtracking.'&#... 详细信息
来源: 评论
An algorithm of global optimization for solving layout problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1999年 第2期114卷 430-436页
作者: Feng, EM Wang, XL Wang, XM Teng, HF Dalian Univ Technol Dept Appl Math Dalian 116024 Peoples R China
The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem about the artific... 详细信息
来源: 评论