咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
A 2.79 COMPETITIVE on-line algorithm FOR TWO PROCESSOR REAL-TIME SYSTEMS WITH UNIFORM VALUE DENSITY
收藏 引用
Applied Mathematics(A Journal of Chinese Universities) 1997年 第3期12卷 333-342页
作者: YANGQIFAN DepartmentofAppliedMathematics ZhejiangUniversityHangthou310027.
We consider the problem of competitive on-liae scheduling in two processor real-timesystems. In our model all tasks have common value density. Each task has a release time. an exe-cution time and a deadline. The sched... 详细信息
来源: 评论
An on-line algorithm to Determine the Location of the Server in a Server Migration Service  12
An On-line Algorithm to Determine the Location of the Server...
收藏 引用
2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC)
作者: Hoshino, Yuta Fukushima, Yukinobu Murase, Tutomu Yokohira, Tokumi Suda, Tatsuya Okayama Univ Grad Sch Nat Sci & Technol Okayama Japan NEC Corp Ltd Cloud Syst Res Labs Kawasaki Kanagawa Japan Univ Netgrp Inc Fallbrook CA USA
In IaaS cloud services, QoS of network applications (NW-Apps) may degrade due to location factors such as significant distance between a server-side application (server) of a NW-App at a data center and a client-side ... 详细信息
来源: 评论
An optimal on-line algorithm for preemptive scheduling on two uniform machines in the lp norm
收藏 引用
4th International Conference on algorithmic Aspects in Information and Management
作者: Shuai, Tianping Du, Donglei Jiang, Xiaoyue Beijing Univ Posts & Telecommun Sch Sci Beijing Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB Canada Louisiana State Univ Engn Coll Baton Rouge LA USA
One of the basic and fundamental problems in scheduling is to minimize the machine completion time vector in the l(p) norm (a direct extension of the l(infinity) norm: the makespan) on uniform parallel machines. We co... 详细信息
来源: 评论
To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
收藏 引用
COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE 2021年 第3期10卷 215-233页
作者: Fiori-Carones, Marta Marcone, Alberto Univ Udine Dipartimento Sci Matemat Informat & Fis Via Sci 208 I-33100 Udine Italy
We define an on-line (incremental) algorithm that, given a (possibly infinite) pseudo-transitive oriented graph, produces a transitive reorientation. This implies that a theorem of Ghouila-Houri is provable in RCA(0) ... 详细信息
来源: 评论
A Best on-line algorithm for Single Machine Scheduling the Equal Length Jobs with the Special Chain Precedence and Delivery Time
A Best On-line Algorithm for Single Machine Scheduling the E...
收藏 引用
4th International Conference on Graphic and Image Processing (ICGIP)
作者: Gu, Cunchang Mu, Yundong Henan Univ Technol Coll Sci Zhengzhou 450000 Peoples R China
In this paper, we consider a single machine on-line scheduling problem with the special chains precedence and delivery time. All jobs arrive over time. The chains(i) chains arrive at time r(i), it is known that the pr... 详细信息
来源: 评论
An on-line algorithm for Music-to-Score Alignment of Guzheng Performance  23
An On-line Algorithm for Music-to-Score Alignment of Guzheng...
收藏 引用
23rd IEEE International Conference on Digital Signal Processing (DSP)
作者: Wang, Ziyi Cao, Yin Tsinghua Univ Dept Elect Engn Beijing Peoples R China Chinese Acad Sci Inst Acoust Key Lab Noise & Vibrat Res Beijing Peoples R China
There are many obstacles preventing new learners of the Guzheng from getting faster improvements. For example, the need to flip the music sheet with one hand interrupts the consistency of the performance. To overcome ... 详细信息
来源: 评论
An on-line algorithm for generation of stable mappings in a generalized modular network SOM
收藏 引用
International Congress Series 2007年 1301卷 164-167页
作者: Tokunaga, Kazuhiro Furukawa, Tetsuo Kyushu Institute of Technology Kitakyushu 808-0196 Japan
Recently, we proposed a modular network SOM (mnSOM) in which each nodal unit of the conventional SOM is replaced by a neural network module. In the mnSOM, the learning algorithm is based on the batch learning SOM for ... 详细信息
来源: 评论
A fast on-line algorithm for the longest common subsequence problem with constant alphabet
A fast On-Line algorithm for the longest common subsequence ...
收藏 引用
作者: Sakai, Yoshifumi Graduate School of Agricultural Science Tohoku University Sendai-shi 981-8555 Japan
This article presents an algorithm that solves an on-line version of the longest common subsequence (LCS) problem for two strings over a constant alphabet in O(d+n) time and O(m+d) space, where m is the length of the ... 详细信息
来源: 评论
An On-line Competitive algorithm for Coloring Bipartite Graphs Without Long Induced Paths
收藏 引用
algorithmICA 2017年 第4期77卷 1060-1070页
作者: Micek, Piotr Wiechert, Veit Jagiellonian Univ Theoret Comp Sci Dept Fac Math & Comp Sci Krakow Poland Tech Univ Berlin Inst Math Berlin Germany
The existence of an on-line competitive algorithm for coloring bipartite graphs is a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as... 详细信息
来源: 评论
A Novel On-line Association algorithm for Supporting Load Balancing in Multiple-AP Wireless LAN
收藏 引用
MOBILE NETWORKS & APPLICATIONS 2018年 第3期23卷 395-406页
作者: Sun, Liang Wang, Lei Qin, Zhenquan Yuan, Zhuxiu Chen, Yuanfang Dalian Univ Technol Sch Software Dalian Peoples R China Hangzhou Dianzi Univ Sch Cyberspace Hangzhou Zhejiang Peoples R China
Nowadays, wireless LAN has become the most widely deployed technology in mobile devices for providing Internet access. Operators and service providers remarkably increase the density of wireless access points in order... 详细信息
来源: 评论