On the public citation graph

On the competitiveness of on-line real-time task scheduling

https://doi.org/10.1007/bf00365406
0 signed · 159 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/real.1990.128746openalex-snapshot
Preemptively scheduling hard-real-time sporadic tasks on one processor
inferredcites →https://doi.org/10.1109/sfcs.1991.185354openalex-snapshot
On-line scheduling in the presence of overload
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471028959.sof275openalex-snapshot
Real‐Time Resource Management Techniques
inferred← citeshttps://doi.org/10.1002/9780470455432.ch23openalex-snapshot
Two Auction‐Based Resource Allocation Environments: Design and Experience
inferred← citeshttps://doi.org/10.1002/9781119042976.ch1openalex-snapshot
Scheduling in Energy Autonomous Objects
inferred← citeshttps://doi.org/10.1002/jos.84openalex-snapshot
Maximizing job benefits on-line
inferred← citeshttps://doi.org/10.1002/jos.85openalex-snapshot
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
inferred← citeshttps://doi.org/10.1006/jagm.2000.1128openalex-snapshot
Eliminating Migration in Multi-processor Scheduling
inferred← citeshttps://doi.org/10.1007/11775096_6openalex-snapshot
Maximizing the Throughput of Multiple Machines On-Line
inferred← citeshttps://doi.org/10.1007/11785293_6openalex-snapshot
Variable Sized Online Interval Coloring with Bandwidth
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_11openalex-snapshot
Online Real-Time Preemptive Scheduling of Jobs with Deadlines
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_41openalex-snapshot
On-Line Scheduling with Tight Deadlines
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_43openalex-snapshot
Improved Competitive Algorithms for Online Scheduling with Partial Job Values
inferred← citeshttps://doi.org/10.1007/3-540-45136-6_14openalex-snapshot
Implementing a Flexible Scheduler in Ada
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_68openalex-snapshot
Preemptive Scheduling in Overloaded Systems
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_23openalex-snapshot
Fault-tolerant real-time scheduling
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_20openalex-snapshot
Maximizing Job Completions Online
inferred← citeshttps://doi.org/10.1007/978-1-4615-5535-3_2openalex-snapshot
Terminology and Assumptions
inferred← citeshttps://doi.org/10.1007/978-1-4615-5535-3_5openalex-snapshot
Planning-Based Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_11openalex-snapshot
A General Framework for Handling Commitment in Online Throughput Maximization
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_30openalex-snapshot
A Competitive Algorithm for Throughput Maximization on Identical Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-45410-3_9openalex-snapshot
Handling Overload Conditions
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_10openalex-snapshot
Maximizing Throughput for Parallel Jobs with Speed-Up Curves
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_55openalex-snapshot
Scheduling Parallelizable Jobs Online to Maximize Throughput
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_24openalex-snapshot
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_19openalex-snapshot
Online Interval Scheduling: Randomized and Multiprocessor Cases
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_42openalex-snapshot
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_5openalex-snapshot
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_42openalex-snapshot
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
inferred← citeshttps://doi.org/10.1007/978-3-642-54477-4_1-1openalex-snapshot
Adaptive Methods for Handling Overload Conditions in Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-88049-0_17openalex-snapshot
Asynchronous Decentralized Realtime Computer Systems
inferred← citeshttps://doi.org/10.1007/bf01264051openalex-snapshot
Real-time databases
inferred← citeshttps://doi.org/10.1007/bfb0015424openalex-snapshot
Scheduling parallel tasks with individual deadlines
inferred← citeshttps://doi.org/10.1007/bfb0022137openalex-snapshot
On real-time and non real-time distributed computing
inferred← citeshttps://doi.org/10.1007/s00224-013-9528-2openalex-snapshot
Improved Randomized Online Scheduling of Intervals and Jobs
inferred← citeshttps://doi.org/10.1007/s00453-003-1025-6openalex-snapshot
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
inferred← citeshttps://doi.org/10.1007/s00453-007-9071-0openalex-snapshot
Variable Sized Online Interval Coloring with Bandwidth
inferred← citeshttps://doi.org/10.1007/s00453-014-9940-2openalex-snapshot
Online Scheduling of Jobs with Fixed Start Times on Related Machines
inferred← citeshttps://doi.org/10.1007/s00453-023-01201-4openalex-snapshot
Approximations for Throughput Maximization
inferred← citeshttps://doi.org/10.1007/s004530010034openalex-snapshot
Fault-Tolerant Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/s10107-020-01469-2openalex-snapshot
A general framework for handling commitment in online throughput maximization
inferred← citeshttps://doi.org/10.1007/s10107-023-02045-0openalex-snapshot
A competitive algorithm for throughput maximization on identical machines
inferred← citeshttps://doi.org/10.1007/s10878-007-9131-zopenalex-snapshot
Online interval scheduling: randomized and multiprocessor cases
inferred← citeshttps://doi.org/10.1007/s10951-013-0321-5openalex-snapshot
Online scheduling with preemption or non-completion penalties
inferred← citeshttps://doi.org/10.1007/s10951-017-0522-4openalex-snapshot
Scheduling multipacket frames with frame deadlines
inferred← citeshttps://doi.org/10.1007/s11241-010-9100-yopenalex-snapshot
Competitive analysis of online real-time scheduling algorithms under hard energy constraint
inferred← citeshttps://doi.org/10.1007/s11241-017-9293-4openalex-snapshot
Automated competitive analysis of real-time scheduling with graph games
inferred← citeshttps://doi.org/10.1007/s11590-017-1191-0openalex-snapshot
Online C-benevolent job scheduling on multiple machines
inferred← citeshttps://doi.org/10.1016/0263-2241(94)00039-aopenalex-snapshot
A schedulability analysis of tasks and network traffic in distributed real-time systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00282-nopenalex-snapshot
Random trees in queueing systems with deadlines
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90165-1openalex-snapshot
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
inferred← citeshttps://doi.org/10.1016/b978-1-78548-125-3.50009-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.cie.2007.02.005openalex-snapshot
A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times
inferred← citeshttps://doi.org/10.1016/j.cie.2010.12.011openalex-snapshot
Online deadline scheduling with preemption penalties
inferred← citeshttps://doi.org/10.1016/j.ic.2017.12.002openalex-snapshot
Improved bounds for randomized preemptive online matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.020openalex-snapshot
Lower bounds on online deadline scheduling with preemption penalties
inferred← citeshttps://doi.org/10.1016/j.jda.2010.07.001openalex-snapshot
Online time-constrained scheduling in linear and ring networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.06.011openalex-snapshot
Using an adversary simulator to evaluate global EDF scheduling of sporadic task sets on multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jss.2012.09.002openalex-snapshot
On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors
inferred← citeshttps://doi.org/10.1016/j.procir.2019.02.045openalex-snapshot
On the open job-shop scheduling problem: a decentralized multi-agent approach for the manufacturing system performance optimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.046openalex-snapshot
Improved competitive algorithms for online scheduling with partial job values
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00070-9openalex-snapshot
Preemptive scheduling in overloaded systems
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00019-4openalex-snapshot
Randomized online interval scheduling
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00074-9openalex-snapshot
Maximizing job completions online
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00407-3openalex-snapshot
On-line scheduling with tight deadlines
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00178-3openalex-snapshot
Scheduling parallel tasks with individual deadlines
inferred← citeshttps://doi.org/10.1016/s1383-7621(99)00008-9openalex-snapshot
The meaning and role of value in scheduling flexible real-time systems
inferred← citeshttps://doi.org/10.1016/s1574-0021(05)02028-9openalex-snapshot
Chapter 28 Automated Markets and Trading Agents
inferred← citeshttps://doi.org/10.1023/a:1008033411290openalex-snapshot
Non-Preemptive Real-Time Scheduling of Multimedia Tasks
inferred← citeshttps://doi.org/10.1023/a:1008089718353openalex-snapshot
An Optimal Value-Based Admission Policy and its Reflective Use in Real-Time Systems
inferred← citeshttps://doi.org/10.1023/a:1008097300762openalex-snapshot
Processing inflected morphology in second language word recognition: Russian-speakers and English-speakers read Hebrew
inferred← citeshttps://doi.org/10.1023/a:1022994010777openalex-snapshot
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control
inferred← citeshttps://doi.org/10.1023/a:1022998111685openalex-snapshot
Competitive Deadline Scheduling via Additional or Faster Processors
inferred← citeshttps://doi.org/10.1023/b:josh.0000031423.39762.d3openalex-snapshot
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
inferred← citeshttps://doi.org/10.1080/0740817x.2015.1078016openalex-snapshot
Reserve driver scheduling
inferred← citeshttps://doi.org/10.1080/24725854.2019.1657606openalex-snapshot
Approximation algorithms for scheduling C-benevolent jobs on weighted machines
inferred← citeshttps://doi.org/10.1109/12.620484openalex-snapshot
Scheduling for overload in real-time systems
inferred← citeshttps://doi.org/10.1109/12.713322openalex-snapshot
Competitive on-line scheduling of imprecise computations
inferred← citeshttps://doi.org/10.1109/2.386982openalex-snapshot
Implications of classical scheduling results for real-time systems
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120157openalex-snapshot
Optimal deadline scheduling with commitment
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120300openalex-snapshot
Scheduling for data center interactive services
inferred← citeshttps://doi.org/10.1109/ccece.2009.5090187openalex-snapshot
Scheduling active camera resources for multiple moving targets
inferred← citeshttps://doi.org/10.1109/ecrts.2005.27openalex-snapshot
Scheduling Tasks with Markov-Chain Based Constraints
inferred← citeshttps://doi.org/10.1109/emrts.2001.933990openalex-snapshot
Three obstacles to flexible scheduling
inferred← citeshttps://doi.org/10.1109/etfa.1995.496774openalex-snapshot
A general approach to real-time message scheduling over distributed broadcast channels
inferred← citeshttps://doi.org/10.1109/hicss.1996.495495openalex-snapshot
Competitive on-line scheduling of imprecise computations
inferred← citeshttps://doi.org/10.1109/icdcs.2011.91openalex-snapshot
Tians Scheduling: Using Partial Processing in Best-Effort Applications
inferred← citeshttps://doi.org/10.1109/icon.1999.796193openalex-snapshot
Information scheduling in a military satellite broadcast system
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019250openalex-snapshot
On-line admission control and packet scheduling with interleaving
inferred← citeshttps://doi.org/10.1109/infcom.2005.1498316openalex-snapshot
Online time-constrained scheduling in linear networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567052openalex-snapshot
Online packet scheduling with hard deadlines in multihop communication networks
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925218openalex-snapshot
On the speed requirement for optimal deadline scheduling in overloaded systems
inferred← citeshttps://doi.org/10.1109/ipdps.2013.26openalex-snapshot
Energy-Efficient Scheduling for Best-Effort Interactive Services to Achieve High Response Quality
inferred← citeshttps://doi.org/10.1109/iscc.1998.702617openalex-snapshot
Non-preemptive real-time scheduling of multimedia tasks
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004262openalex-snapshot
Online real-time job scheduling with rate of progress guarantees
inferred← citeshttps://doi.org/10.1109/pesgm.2012.6345497openalex-snapshot
Large scale charging of Electric Vehicles
inferred← citeshttps://doi.org/10.1109/real.1992.242650openalex-snapshot
D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systems
inferred← citeshttps://doi.org/10.1109/real.1993.393503openalex-snapshot
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
inferred← citeshttps://doi.org/10.1109/real.1994.342713openalex-snapshot
On-line scheduling to maximize task completions
inferred← citeshttps://doi.org/10.1109/real.2001.990610openalex-snapshot
Static-priority scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1109/real.2003.1253286openalex-snapshot
Firm real-time system scheduling based on a novel QoS constraint
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180171openalex-snapshot
Implementing quality of service in Web servers
inferred← citeshttps://doi.org/10.1109/rtss.2014.9openalex-snapshot
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks
inferred← citeshttps://doi.org/10.1109/rttas.1998.683182openalex-snapshot
Overload tolerance for single-processor workloads
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492478openalex-snapshot
Speed is as powerful as clairvoyance [scheduling problems]
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959909openalex-snapshot
Approximation algorithms for the job interval selection problem and related scheduling problems
inferred← citeshttps://doi.org/10.1109/smartgridcomm.2012.6486056openalex-snapshot
iEMS for large scale charging of electric vehicles: Architecture and optimal online scheduling
inferred← citeshttps://doi.org/10.1109/tc.2006.41openalex-snapshot
Firm real-time system scheduling based on a novel QoS constraint
inferred← citeshttps://doi.org/10.1109/tc.2013.21openalex-snapshot
A Note on EDF Schedulingfor Real-Time Energy Harvesting Systems
inferred← citeshttps://doi.org/10.1109/tcad.2020.3012803openalex-snapshot
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/tnet.2014.2363136openalex-snapshot
Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks
inferred← citeshttps://doi.org/10.1109/tnet.2021.3065703openalex-snapshot
Asymptotically Optimal Online Scheduling With Arbitrary Hard Deadlines in Multi-Hop Communication Networks
inferred← citeshttps://doi.org/10.1109/tnet.2022.3193381openalex-snapshot
Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2466612openalex-snapshot
A Neurodynamic Approach for Real-Time Scheduling via Maximizing Piecewise Linear Utility
inferred← citeshttps://doi.org/10.1111/itor.13423openalex-snapshot
Scheduling‐location problem with drones
inferred← citeshttps://doi.org/10.1111/j.1937-5956.2007.tb00271.xopenalex-snapshot
Games and Mechanism Design in Machine Scheduling—An Introduction
inferred← citeshttps://doi.org/10.1137/s0097539792236882openalex-snapshot
$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1137/s0097539795283292openalex-snapshot
Bounding the Power of Preemption in Randomized Scheduling
inferred← citeshttps://doi.org/10.1137/s0097539797326241openalex-snapshot
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
inferred← citeshttps://doi.org/10.1137/s0097539799354138openalex-snapshot
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
inferred← citeshttps://doi.org/10.1142/s0129054103001789openalex-snapshot
On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees
inferred← citeshttps://doi.org/10.1142/s0129054105003170openalex-snapshot
ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
inferred← citeshttps://doi.org/10.1142/s1793830910000632openalex-snapshot
ON THE LOWER BOUND OF THE COMPETITIVE RATIO FOR THE WEIGHTED ONLINE ROOMMATES PROBLEM
inferred← citeshttps://doi.org/10.1145/1007912.1007927openalex-snapshot
Packet-mode policies for input-queued switches
inferred← citeshttps://doi.org/10.1145/1654059.1654098openalex-snapshot
Evaluating the impact of inaccurate information in utility-based scheduling
inferred← citeshttps://doi.org/10.1145/225058.225278openalex-snapshot
Bounding the power of preemption in randomized scheduling
inferred← citeshttps://doi.org/10.1145/225058.225279openalex-snapshot
Bandwidth allocation with preemption
inferred← citeshttps://doi.org/10.1145/2461328.2461356openalex-snapshot
Automated analysis of real-time scheduling using graph games
inferred← citeshttps://doi.org/10.1145/2484838.2484864openalex-snapshot
Multi-query scheduling for time-critical data stream applications
inferred← citeshttps://doi.org/10.1145/2742343openalex-snapshot
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters
inferred← citeshttps://doi.org/10.1145/2935764.2935771openalex-snapshot
General Profit Scheduling and the Power of Migration on Heterogeneous Machines
inferred← citeshttps://doi.org/10.1145/301250.301420openalex-snapshot
Approximating the throughput of multiple machines under real-time scheduling
inferred← citeshttps://doi.org/10.1145/3087556.3087590openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3143314.3078540openalex-snapshot
On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks
inferred← citeshttps://doi.org/10.1145/3350755.3400271openalex-snapshot
Commitment and Slack for Online Load Maximization
inferred← citeshttps://doi.org/10.1145/335305.335401openalex-snapshot
Improvements in throughout maximization for real-time scheduling
inferred← citeshttps://doi.org/10.1145/3394810.3394818openalex-snapshot
Optimizing Vehicle-to-Cloud Data Transfers using Soft Real-Time Scheduling Concepts
inferred← citeshttps://doi.org/10.1145/3397166.3409122openalex-snapshot
Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing
inferred← citeshttps://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance
inferred← citeshttps://doi.org/10.1145/3569582openalex-snapshot
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
inferred← citeshttps://doi.org/10.1145/3626781openalex-snapshot
Near-Optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints
inferred← citeshttps://doi.org/10.1145/959143.959163openalex-snapshot
Hard deadline queueing system with application to unified messaging service
inferred← citeshttps://doi.org/10.1145/988772.988783openalex-snapshot
Mechanism design for online real-time scheduling
inferred← citeshttps://doi.org/10.11575/prism/31816openalex-snapshot
Efficient Algorithms for Dynamic Cloud Resource Provisioning
inferred← citeshttps://doi.org/10.1287/moor.1060.0218openalex-snapshot
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
inferred← citeshttps://doi.org/10.1504/ijcnds.2009.026878openalex-snapshot
Implementing assuring forward per hop behaviour class in web servers with dynamic scheduling and selective discards
inferred← citeshttps://doi.org/10.1613/jair.5100openalex-snapshot
Efficient Mechanism Design for Online Scheduling
inferred← citeshttps://doi.org/10.2139/ssrn.3137745openalex-snapshot
The Online Reservation Problem
inferred← citeshttps://doi.org/10.24963/ijcai.2017/707openalex-snapshot
Efficient Mechanism Design for Online Scheduling (Extended Abstract)
inferred← citeshttps://doi.org/10.26076/310a-0e50openalex-snapshot
An Energy-Efficient Semi-Partitioned Approach for Hard Real-Time Systems with Voltage and Frequency Islands
inferred← citeshttps://doi.org/10.32657/10220/46906openalex-snapshot
Combinatorial algorithms for scheduling jobs to minimize server usage time
inferred← citeshttps://doi.org/10.3390/app132011470openalex-snapshot
An Optimal Scheduling Technique for Smart Grid Communications over 5G Networks
inferred← citeshttps://doi.org/10.4018/japuc.2012040106openalex-snapshot
New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.41openalex-snapshot
Optimally Handling Commitment Issues in Online Throughput Maximization
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.389openalex-snapshot
Improved Bounds for Online Preemptive Matching
inferred← citeshttps://doi.org/10.48550/arxiv.2001.10037openalex-snapshot
Approximations for Throughput Maximization
inferred← citeshttps://doi.org/10.48550/arxiv.2111.06564openalex-snapshot
A Competitive Algorithm for Throughput Maximization on Identical Machines
inferred← citeshttps://doi.org/10.70675/85642a82z8494z411cz9564ze1a7ffcc89c4openalex-snapshot
Equilibrage de charge efficace et adaptatif avec contraintes temporelles pour les véhicules connectés
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.