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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2017
012319922017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • Mohamed Chentouf, Alaoui Ismaili, Zine El Abidine
  • 2017
Power optimization is a very important and challenging step in the physical design flow, and it is a critical success factor of… (More)
  • figure 2
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2017
2017
In this paper, we study the process of physical state transition in the embedded system. The key to dramatically increase the… (More)
Is this relevant?
2017
2017
Conventional coupled dictionary learning approaches are designed for noiseless image super-resolution (SR), but quite sensitive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2015
2015
Terrain identification is essential for the control of robotic transtibial prostheses to realize smooth locomotion transitions… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
We introduce a novel global Markov transition constraint (Mtc) to model finite state homogeneous Markov chains. We present two… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2014
2014
Latent models for opinion classification are studied. Training a probabilistic model with a number of latent variables is found… (More)
  • figure 1
  • table 3
  • figure 3
  • figure 4
Is this relevant?
2012
2012
In this paper, we propose a checking algorithm for dynamic constraint validation during XML updates. Our algorithm is targeted at… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 8
Is this relevant?
2007
2007
This thesis presents an extension of deductive model checking that uses phase event automata to verify, if a given reactive… (More)
  • figure 2.3
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 5.2
Is this relevant?
2004
2004
Transitions. We used a fixed finite set of expressions over states (which are constraints in unprimed variables) to partition the… (More)
Is this relevant?
2002
2002
Scheduling problems belong to a very successful application area of constraint programming partially thanks to many specialised… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?