Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,037,453 papers from all fields of science
Search
Sign In
Create Free Account
Online algorithm
Known as:
Online algorithms
, Offline algorithm
, Online problem
Expand
In computer science, an online algorithm is one that can only process its input piece-by-piece in a serial fashion, i.e., in the order that the input…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adversary model
Algorithm
Algorithms for calculating variance
Amortized analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Capacity of the energy harvesting channel with a finite battery
Dor Shaviv
,
Phan-Minh Nguyen
,
Ayfer Özgür
International Symposium on Information Theory
2015
Corpus ID: 7933849
We consider an energy harvesting channel, in which the transmitter is powered by an exogenous stochastic energy arrival process…
Expand
2011
2011
An expert system for improving web-based problem-solving ability of students
Gwo-jen Hwang
,
Chieh-Yuan Chen
,
Pei-Shan Tsai
,
Chin-Chung Tsai
Expert systems with applications
2011
Corpus ID: 44710456
2007
2007
Designing for Learner Engagement in Middle School Science
A. Harmer
,
W. M. Cates
2007
Corpus ID: 57578120
Abstract Engaging middle-school students in scientific inquiry is typically recognized as important, but difficult. Designed to…
Expand
Highly Cited
2005
Highly Cited
2005
Energy efficient multi-hop polling in clusters of two-layered heterogeneous sensor networks
Zhenghao Zhang
,
Mingchi Ma
,
Yuanyuan Yang
IEEE International Parallel and Distributed…
2005
Corpus ID: 6205131
In this paper we study two-layered heterogeneous sensor networks where two types of nodes are deployed in the network: basic…
Expand
2004
2004
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
E. Angelelli
,
Á. Nagy
,
M. Speranza
,
Z. Tuza
Journal of Scheduling
2004
Corpus ID: 9515851
AbstractIn this paper we investigate a semi on-line multiprocessor scheduling problem. The problem is the classical on-line…
Expand
2004
2004
On the Character and Complexity of Certain Defensive Resource Allocation Problems
W. P. Malcolm
2004
Corpus ID: 40849167
Abstract : In this article we consider two classes of static defensive resource allocation problems, these are, the static…
Expand
Highly Cited
1999
Highly Cited
1999
Efficient On-Line Nonparametric Kernel Density Estimation
Christophe Gerard Lambert
,
S. E. Harrington
,
C. R. Harvey
,
A. Glodjo
Algorithmica
1999
Corpus ID: 33550162
Abstract. Nonparametric density estimation has broad applications in computational finance especially in cases where high…
Expand
1999
1999
Scheduling garbage collector for embedded real-time systems
Taehyoun Kim
,
N. Chang
,
Namyun Kim
,
Heonshik Shin
ACM SIGPLAN Conference on Languages, Compilers…
1999
Corpus ID: 15942098
This paper proposes a new scheduling method for multiple mutators and a garbage collector running on embedded real-time systems…
Expand
1999
1999
Trade-offs between speed and processor in hard-deadline scheduling
T. Lam
,
I. K. To
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 14602778
This paper revisits the problem of on-line scheduling of sequential jobs with hard deadlines in a preemptive, multiprocessor…
Expand
Highly Cited
1995
Highly Cited
1995
Parametric Dispatching of Hard Real-Time Tasks
R. Gerber
,
W. Pugh
,
M. Saksena
IEEE Trans. Computers
1995
Corpus ID: 14754027
In many real-time systems relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE