咨询与建议

限定检索结果

文献类型

  • 122 篇 期刊文献
  • 35 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 108 篇 工学
    • 90 篇 计算机科学与技术...
    • 18 篇 电气工程
    • 15 篇 软件工程
    • 11 篇 信息与通信工程
    • 7 篇 机械工程
    • 6 篇 控制科学与工程
    • 4 篇 电子科学与技术(可...
    • 2 篇 石油与天然气工程
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 轻工技术与工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 食品科学与工程(可...
  • 63 篇 理学
    • 60 篇 数学
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 37 篇 管理学
    • 37 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 9 篇 经济学
    • 9 篇 应用经济学
  • 2 篇 医学
    • 2 篇 临床医学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学
    • 1 篇 畜牧学
  • 1 篇 军事学

主题

  • 157 篇 on-line algorith...
  • 23 篇 scheduling
  • 21 篇 competitive anal...
  • 17 篇 competitive rati...
  • 11 篇 approximation al...
  • 10 篇 worst-case analy...
  • 6 篇 bin packing
  • 5 篇 single machine
  • 5 篇 makespan
  • 5 篇 delivery time
  • 5 篇 supply chain sch...
  • 4 篇 load balancing
  • 4 篇 lower bound
  • 4 篇 computational ge...
  • 4 篇 randomized algor...
  • 4 篇 combinatorial op...
  • 4 篇 preemption
  • 3 篇 delivery cost
  • 3 篇 graph
  • 3 篇 approximation

机构

  • 6 篇 zhejiang univ co...
  • 6 篇 zhengzhou univ d...
  • 5 篇 zhejiang univ de...
  • 4 篇 mit alfred p slo...
  • 3 篇 zhengzhou univ s...
  • 3 篇 henan univ techn...
  • 2 篇 univ louisville ...
  • 2 篇 zhongyuan univ t...
  • 2 篇 graz tech univ i...
  • 2 篇 zhengzhou inst a...
  • 2 篇 e china univ sci...
  • 2 篇 eindhoven univ t...
  • 2 篇 tech univ berlin...
  • 2 篇 univ calif santa...
  • 2 篇 henan agr univ c...
  • 2 篇 australian natl ...
  • 2 篇 hiroshima univ g...
  • 2 篇 hong kong polyte...
  • 2 篇 fern univ hagen ...
  • 2 篇 beijing univ pos...

作者

  • 6 篇 ye deshi
  • 5 篇 schulz as
  • 5 篇 zhang gc
  • 4 篇 lu lingfa
  • 4 篇 lu xiwen
  • 4 篇 woeginger gj
  • 3 篇 yuan jinjiang
  • 3 篇 averbakh igor
  • 3 篇 tamassia r
  • 3 篇 skutella m
  • 3 篇 vestjens apa
  • 3 篇 zhang guochuan
  • 3 篇 tian ji
  • 3 篇 mu yundong
  • 3 篇 fu ruyan
  • 3 篇 zhang liqi
  • 2 篇 giorgio ausiello
  • 2 篇 he qinming
  • 2 篇 li wenjie
  • 2 篇 cai yuhua

语言

  • 151 篇 英文
  • 6 篇 其他
检索条件"主题词=On-line algorithm"
157 条 记 录,以下是131-140 订阅
排序:
On producing exactly rounded results in digit-serial on-line arithmetic
On producing exactly rounded results in digit-serial on-line...
收藏 引用
34th Asilomar Conference on Signals, Systems, and Computers
作者: Parhami, B Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA
The input and output of an on-line computation involving redundant numbers must generally be compatible with standard nonredundant formats. When rounding of a result is required in the last computation step, the proce... 详细信息
来源: 评论
An Optimal On-line Strategy for Walking in Streets with Minimal Sensing  2
An Optimal On-line Strategy for Walking in Streets with Mini...
收藏 引用
2nd IEEE International Conference on Computer and Communications (ICCC)
作者: Wei, Qi Tan, Xuehou Dalian Maritime Univ Sch Informat Sci & Technol Dalian Peoples R China Tokai Univ Sch Informat Sci & Technol Tokyo Japan
This paper considers the problem of walking in the street with a mobile robot. The robot starts from a point s to search the target point t. The robot is equipped with a minimal sensing sensor that can only detect the... 详细信息
来源: 评论
SIMULATION AS A TOOL FOR THE EVALUATION OF FOREST MANAGEMENT TREATMENTS
SIMULATION AS A TOOL FOR THE EVALUATION OF FOREST MANAGEMENT...
收藏 引用
24th Annual European Simulation and Modelling Conference (ESM 2010)
作者: Ahonen-Jonnarth, Ulla Odelstad, Jan Univ Gavle Fac Engn & Sustainable Dev Dept Ind Dev IT & Land Management Gavle Sweden
Cleaning of young forest stands is a multicriteria problem with conflicting goals. This kind of forest management treatment is performed by human beings but it is possible that this work may be performed by artificial... 详细信息
来源: 评论
Fast hybrid method of parallel tabu search and ordinal optimization for on-line capacitor control in distribution systems
Fast hybrid method of parallel tabu search and ordinal optim...
收藏 引用
IEEE-Power-Engineering-Society General Meeting
作者: Mori, H Tani, H Meiji Univ Dept Elect & Elect Engn Tama Ku Kawasaki Kanagawa 2148571 Japan
This paper proposes a fast method for on-line capacitor control in distribution systems. The proposed method makes use of a hybrid method of parallel tabu search (PTS) and ordinal optimization (OO) to determine the op... 详细信息
来源: 评论
On-line computation and maximum-weighted hereditary subgraph problems
收藏 引用
16th International Symposium on algorithms and Computations (ISAAC 2005)
作者: Demange, M Kouakou, B Soutif, É ESSEC SID Dept F-95021 Cergy Pontoise France Univ Paris 01 CERMSEM F-75013 Paris France Conservatoire Natl Arts & Metiers CEDRIC F-75003 Paris France
In this paper, we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance-graph (which has n vertices) is revealed in t clusters, 2 <= t <= n. We firs... 详细信息
来源: 评论
On-line Rescheduling to Minimize Makespan nuder a Limit on the Maximum Sequence Disruption
On-line Rescheduling to Minimize Makespan nuder a Limit on t...
收藏 引用
IITA International Conference on Services Science, Management and Engineering
作者: Mu, Yundong Guo, Xiao Henan Univ Technol Coll Sci Zhengzhou 450000 Peoples R China
In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives over time. The decision maker needs to insert the new ... 详细信息
来源: 评论
Three Open On- line CombinatorialOptimization Problems
收藏 引用
Journal of Systems Science and Systems Engineering 2001年 第1期13卷 125-128页
作者: ZHANG Yu zhong1, LI Shu jin 2, DENG Xiao tie3 1.Institute of Operations Research, Qufu Normal University, 273165 2.Shandong Educational College, Jinan 250013 3.Deptartment of CS, City University of Hong Kong, Kowloon, HK Institute of Operations Research Qufu Normal University 273165 Shandong Educational College Jinan 250013 Deptartment of CS City University of Hong Kong Kowloon HK
:We present three open combinatorial optimization problems from the standpoint of competitive analysis, in the case that there is no complete information.
来源: 评论
Bayesian Variable Selection in linear Regression in One Pass for Large Datasets
收藏 引用
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA 2014年 第1期9卷 3-3页
作者: Ordonez, Carlos Garcia-Alvarado, Carlos Baladandayuthapani, Veerabhadaran Univ Houston Houston TX 77004 USA UT MD Anderson Canc Ctr Houston TX USA
Bayesian models are generally computed with Markov Chain Monte Carlo (MCMC) methods. The main disadvantage of MCMC methods is the large number of iterations they need to sample the posterior distributions of model par... 详细信息
来源: 评论
ISOLATED WORD RECOGNITION BY RECURSIVE HMM PARAMETER ESTIMATION algorithm
收藏 引用
COMPUTING AND INFORMATICS 2021年 第2期40卷 277-297页
作者: Vaiciulyte, Jurate Sakalauskas, Leonidas Vilniaus Kolegija Univ Appl Sci Fac Elect & Informat Vilnius Lithuania Vilnius Univ Siauliai Acad Shiauliai Lithuania
Automatic speech recognition (ASR) technologies enable humans to communicate with computers. Isolated word recognition (IWR) is an important part of many known ASR systems. Minimizing the word error rate in cases of i... 详细信息
来源: 评论
A SEMI-ON-line SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME
收藏 引用
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2012年 第4期29卷 1250020-1250020页
作者: Cai, Yuhua Feng, Qi Li, Wenjie Zhengzhou Univ Dept Math Zhengzhou 450001 Henan Peoples R China Zhongyuan Univ Technol Coll Sci Zhengzhou 450007 Henan Peoples R China
In this paper, we consider a semi-on-line scheduling problem of two identical machines with common maintenance time interval and nonresumable availability. We prove a lower bound of 2.79129 on the competitive ratio an... 详细信息
来源: 评论