Skip to search formSkip to main contentSkip to account menu

Transition constraint

A transition constraint is a way of enforcing that the data does not enter an impossible state because of a previous state. For example, it should… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Power optimization is a very important and challenging step in the physical design flow, and it is a critical success factor of… 
2017
2017
In this paper, we study the process of physical state transition in the embedded system. The key to dramatically increase the… 
2015
2015
The clock tree network can consume up to 40% of the power budget and is one of the limiting factors for realizing low power… 
Review
2015
Review
2015
This paper surveys recent research on context-aware workflow systems. It starts by addressing the notion of workflow and the… 
2014
2014
Latent models for opinion classification are studied. Training a probabilistic model with a number of latent variables is found… 
2012
2012
In this paper, we propose a checking algorithm for dynamic constraint validation during XML updates. Our algorithm is targeted at… 
2002
2002
Constraint-based scheduling is an approach for solving scheduling problems using constraint satisfaction techniques. Its main… 
2002
2002
Scheduling problems belong to a very successful application area of constraint programming partially thanks to many specialised… 
1994
1994
This paper deals with database updates. More precisely we focus on addition and deletion operations, when transition constraints… 
1992
1992
It is claimed that object oriented databases (OODBs) overcome many of the limitations of the relational model. However, the…