Skip to search formSkip to main contentSkip to account menu

Schedule (computer science)

Known as: Recoverable, Database schedule, Recoverable execution 
In the fields of databases and transaction processing (transaction management), a schedule (or history) of a system is an abstract model to describe… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Blind writeCommitment orderingConcurrency controlConcurrent computing

Broader (1)

Transaction processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Handbook of Research on Social Interaction Technologies and Collaboration Software: Concepts and Trends
The rapid increase of Internet-based social networking sites has brought attention to the social software phenomenon and… 
Highly Cited
2009
Highly Cited
2009
A hybrid metaheuristic case-based reasoning system for nurse rostering
In this paper we present a novel Case-Based Reasoning (CBR) system called CABAROST (CAsed-BAsed ROSTering) which was developed… 
Highly Cited
2006
Highly Cited
2006
Stress-Induced Martensitic Phase Transformation in Intermetallic Nickel Aluminum Nanowires
Atomistic simulations are utilized to demonstrate a stress-induced martensitic phase transformation in intermetallic nickel… 
Highly Cited
2005
Highly Cited
2005
Pseudoelasticity of Single Crystalline Cu Nanowires Through Reversible Lattice Reorientations
Molecular dynamics simulations are carried out to analyze the structure and mechanical behavior of Cu nanowires with lateral… 
Highly Cited
1998
Highly Cited
1998
Algorithms for the Detection of Su b-Pixel Targets in Multispectral Imagery
A new sub-pixel target detection algorithm is developed that integrates a linear mixing model (LMM) with the powefil "RX" anomaly… 
Highly Cited
1995
Highly Cited
1995
A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
In this paper, we present a branch-and-bound approach for solving a two-machine flow shop scheduling problem, in which the… 
Highly Cited
1990
Highly Cited
1990
Criteria for brittle fracture in compression
Highly Cited
1986
Highly Cited
1986
Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules
  • L. Servi
  • IEEE J. Sel. Areas Commun.
  • 1986
  • Corpus ID: 35543723
The Laplace Transform (and the first two moments) of the busy period of the recently introduced M/G/1 vacation model with a… 
Review
1968
Review
1968
Fault Testing and Diagnosis in Combinational Digital Circuits
Abstract—he problem of designing test schedules for the testing or diagnosis of a small number of nontransient faults in… 
Highly Cited
1964
Highly Cited
1964
Follow-up study of chronically ill patients discharged from hospital
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)