Loop variant

Known as: Bound function 
In computer science, a loop variant is a mathematical function defined on the state space of a computer program whose value is monotonically… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channel… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2007
2007
Device drivers are integral components of operating systems. The computational workloads imposed by device drivers tend to be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for… (More)
  • table 1
  • table 2
Is this relevant?
2007
2007
We introduce a notion of quasi-regularity for points with respect to the inclusion F (x) ∈ C where F is a nonlinear Frechét… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation… (More)
Is this relevant?
2004
2004
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm… (More)
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
2001
2001
This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping… (More)
  • table 1
  • figure 1
  • table 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case… (More)
Is this relevant?
1985
1985
Algorithms for election in asynchronous general networks and in synchronous rings are presented. The algorithms are message… (More)
  • figure 1
Is this relevant?