Results 1 to 10 of about 1,703,578 (134)
An Online Algorithm for Lightweight Grammar-Based Compression
Algorithms, 2012 Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression.
Masayuki Takeda +2 more
doaj +3 more sources
Online Bottleneck Matching Problem with Two Heterogeneous Sensors in a Metric Space
Computation, 2022 In this paper, we consider the online matching problem with two heterogeneous sensors s1 and s2 in a metric space (X,d). If a request r is assigned to sensor s1, the service cost of r is the distance d(r,s1).
Man Xiao, Yaru Yang, Weidong Li
doaj +1 more source
IEEE Access, 2021 With the rapid development of economy and technology, large-scale integrated energy buildings account for an increasing proportion of urban load. However, the randomness of EV owner behaviors, electricity price and outdoor temperature have brought ...
Renli Cheng +7 more
doaj +1 more source
Bin-Packing-Based Online Dynamic Bandwidth and Wavelength Allocation Algorithm in Super-PON
IEEE Access, 2021 Super passive optical network (Super-PON) is a next-generation Ethernet PON (NG-EPON) candidate that is envisaged to provide high data rate and low latency.
Sukriti Garg, Abhishek Dixit
doaj +1 more source
Online Computation with Untrusted Advice [PDF]
, 2020 The advice model of online computation captures the setting in which the online algorithm is given some partial information concerning the request sequence. This paradigm allows to establish tradeoffs between the amount of this additional information and
+4 more
core +2 more sources
Efficient Online Log Parsing with Log Punctuations Signature
Applied Sciences, 2021 Logs, recording the system runtime information, are frequently used to ensure software system reliability. As the first and foremost step of typical log analysis, many data-driven methods have been proposed for automated log parsing.
Shijie Zhang, Gang Wu
doaj +1 more source
A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length
Algorithms, 2021 In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
Kunihiko Hiraishi
doaj +1 more source
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
Algorithms, 2009 Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best
Shuichi Miyazaki, Kazuya Okamoto
doaj +1 more source
Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families
Mathematics, 2020 We considered the online scheduling problem of simple linear deteriorating job families on m parallel batch machines to minimize the makespan, where the batch capacity is unbounded.
Wenhua Li +3 more
doaj +1 more source
Improved Accuracy by Novel Inception Compared over GoogleNet in Predicting the Performance of Students in Online Education During COVID [PDF]
E3S Web of Conferences, 2023 The goal of this research is to enhance the accuracy of predicting students' performance in online education during the Covid-19 pandemic by comparing the Novel Inception algorithm with the GoogleNet algorithm. Materials and Methods: The current research
Sathvik P., Kalaiarasi S.
doaj +1 more source