咨询与建议

限定检索结果

文献类型

  • 234 篇 期刊文献
  • 30 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 220 篇 工学
    • 210 篇 计算机科学与技术...
    • 43 篇 软件工程
    • 19 篇 电气工程
    • 10 篇 控制科学与工程
    • 6 篇 机械工程
    • 5 篇 信息与通信工程
    • 4 篇 电子科学与技术(可...
    • 1 篇 仪器科学与技术
    • 1 篇 航空宇航科学与技...
  • 106 篇 理学
    • 103 篇 数学
    • 1 篇 物理学
  • 31 篇 管理学
    • 31 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 4 篇 经济学
    • 3 篇 应用经济学

主题

  • 264 篇 on-line algorith...
  • 76 篇 competitive anal...
  • 33 篇 scheduling
  • 24 篇 analysis of algo...
  • 14 篇 computational ge...
  • 14 篇 randomized algor...
  • 13 篇 paging
  • 12 篇 approximation al...
  • 12 篇 competitive rati...
  • 7 篇 load balancing
  • 7 篇 algorithms
  • 7 篇 competitiveness
  • 7 篇 combinatorial pr...
  • 6 篇 routing
  • 6 篇 bin packing
  • 6 篇 resource allocat...
  • 6 篇 preemption
  • 5 篇 k-server problem
  • 5 篇 computer arithme...
  • 5 篇 data structures

机构

  • 10 篇 technion israel ...
  • 8 篇 univ hong kong d...
  • 7 篇 tel aviv univ de...
  • 6 篇 max planck inst ...
  • 5 篇 univ haifa dept ...
  • 3 篇 univ calif river...
  • 3 篇 cuny brooklyn co...
  • 3 篇 univ so denmark ...
  • 3 篇 tohoku univ grad...
  • 3 篇 univ calif santa...
  • 3 篇 univ calif san d...
  • 3 篇 univ kaiserslaut...
  • 3 篇 univ zagreb dept...
  • 3 篇 graz tech univ i...
  • 2 篇 technion israel ...
  • 2 篇 int comp sci ins...
  • 2 篇 pusan natl forei...
  • 2 篇 univ karlsruhe f...
  • 2 篇 univ rome la sap...
  • 2 篇 univ calif berke...

作者

  • 9 篇 azar y
  • 7 篇 epstein l
  • 7 篇 leonardi s
  • 7 篇 zhang yong
  • 6 篇 larsen ks
  • 5 篇 albers s
  • 5 篇 bar-noy a
  • 4 篇 marchetti-spacca...
  • 4 篇 boyar j
  • 4 篇 feuerstein e
  • 4 篇 fiat a
  • 4 篇 noga j
  • 4 篇 woeginger gj
  • 3 篇 kotov v
  • 3 篇 moruz gabriel
  • 3 篇 escoffier bruno
  • 3 篇 regev o
  • 3 篇 deng xt
  • 3 篇 xu weijun
  • 3 篇 bonifaci vincenz...

语言

  • 237 篇 英文
  • 27 篇 其他
检索条件"主题词=On-line algorithms"
264 条 记 录,以下是41-50 订阅
排序:
Efficient event handling in Wireless Sensor and Actor Networks: An on-line computation approach
收藏 引用
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2016年 第0期75卷 181-199页
作者: Konstantopoulos, Charalampos Pantziou, Grammati Venetis, Ioannis E. Gavalas, Damianos Univ Piraeus Dept Informat Piraeus Greece Technol Educ Inst Athens Dept Informat Athens Greece Univ Aegean Dept Cultural Technol & Commun Mitilini Greece
The real time response of actors to events occurring in a network area is of critical importance in Wireless Sensor and Actor Networks (WSANs). This in turn requires fast notification of actors from Sensor Nodes (SNs)... 详细信息
来源: 评论
LRU is better than FIFO
收藏 引用
ALGORITHMICA 1999年 第2期23卷 180-185页
作者: Chrobak, M Noga, J Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA Univ Calif Riverside Dept Math Riverside CA 92521 USA
In the paging problem we have to manage a two-level memory system, in which the first level has short access time but can hold only up to k pages, while the second level is very large but slow. We use competitive anal... 详细信息
来源: 评论
On-line edge-coloring with a fixed number of colors
收藏 引用
ALGORITHMICA 2003年 第2期35卷 176-191页
作者: Favrholdt, LM Nielsen, MN Department of Mathematics and Computer Science University of Southern Denmark Campusvej 55 DK-5230 Odense M Denmark. lenem@imada.sdu.dk nyhave@imada.sdu.dk. DK
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors available and the aim is to color as many edges as possible. We prove upper and lower bounds on the performance of different... 详细信息
来源: 评论
Fair versus unrestricted bin packing
收藏 引用
ALGORITHMICA 2002年 第2期34卷 181-196页
作者: Azar, Y Boyar, J Epstein, L Favrholdt, LM Larsen, KS Nielsen, MN Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel Univ So Denmark Dept Math & Comp Sci Odense Denmark Interdisciplinary Ctr Sch Comp & Media Sci Herzliyya Israel
We consider the on-line Dual Bin Packing problem where we have n unit size bins and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. We investigate ... 详细信息
来源: 评论
On an on-line scheduling problem for parallel jobs
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第6期81卷 297-304页
作者: Naroska, E Schwiegelshohn, U Univ Dortmund Comp Engn Inst D-44221 Dortmund Germany
This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem G... 详细信息
来源: 评论
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2011年 第8期38卷 1103-1108页
作者: Krumke, Sven O. Taudes, Alfred Westphal, Stephan Univ Kaiserslautern Dept Math D-67653 Kaiserslautern Germany Vienna Univ Econ & Business Adm Inst Prod Management Vienna Austria
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-preemptive schedule which maximizes the to... 详细信息
来源: 评论
Scheduling uniform machines on-line requires nondecreasing speed ratios
收藏 引用
MATHEMATICAL PROGRAMMING 1998年 第1-2期82卷 225-234页
作者: Vestjens, APA Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands
We consider the following on-line scheduling problem. We have to schedule n independent jobs, where n is unknown, on m uniform parallel machines so as to minimize the makespan;preemption is allowed. Each job becomes a... 详细信息
来源: 评论
Dynamic trees and dynamic point location
收藏 引用
SIAM JOURNAL ON COMPUTING 1998年 第2期28卷 612-636页
作者: Goodrich, MT Tamassia, R Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA Brown Univ Dept Comp Sci Providence RI 02912 USA
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision. The main approach is based on the maintenance of two interlaced spanning trees, one for... 详细信息
来源: 评论
Visibility-based pursuit-evasion in an unknown planar environment
收藏 引用
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 2004年 第1期23卷 3-26页
作者: Sachs, S LaValle, SM Rajko, S Univ Illinois Dept Comp Sci Urbana IL 61801 USA Iowa State Univ Dept Comp Sci Ames IA 50011 USA
We address an on-line version of the visibility-based pursuit-evasion problem. We take a minimalist approach in modeling the capabilities of a pursuer robot. A point pursuer moves in an unknown, simply-connected, piec... 详细信息
来源: 评论
Parallel scheduling problems in next generation wireless networks
收藏 引用
NETWORKS 2005年 第1期45卷 9-22页
作者: Becchetti, L Leonardi, S Marchetti-Spaccamela, A Vitaletti, A Diggavi, S Muthukrishnan, S Nandagopal, T Univ Roma La Sapienza Rome Italy Lab Syst Informat & Commun Lausanne Switzerland Rutgers State Univ Piscataway NJ 08855 USA Bell Labs Holmdel NJ 07733 USA
Next-generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks p... 详细信息
来源: 评论