Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,176,376 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Computational complexity theory
Computer science
Correctness (computer science)
For loop
Expand
Broader (2)
Control flow
Formal methods
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Costas Loop Variant for Large Noise
Janos Ladvanszky
2018
Corpus ID: 44092708
Article History Received: 26 March 2018 Revised: 7 May 2018 Accepted: 11 May 2018 Published: 15 May 2018
2017
2017
Simulations for efficient combination of two lower bound functions in univariate global optimization
Chebbah Mohammed
,
Ouanes Mohand
,
Z. Ahmed
2017
Corpus ID: 9512584
We propose a new method for solving univariate global optimization problems by combining a lower bound function given in (αBB…
Expand
2011
2011
On projective varieties $n$-covered by curves of degree $\delta$
Luc Pirio
,
F. Russo
2011
Corpus ID: 118279167
As proved recently in [PT], for varieties $X^{r+1}\subset \mathbb P^N$ such that through $n\geq 2$ general points there passes an…
Expand
2011
2011
Demand bound server: Generalized resource reservation for hard real-time systems
Pratyush Kumar
,
Jian-Jia Chen
,
L. Thiele
International Conference on Embedded Software
2011
Corpus ID: 603440
Servers have been proposed to implement resource reservations on shared resources. Such reservations isolate the temporal…
Expand
2010
2010
Component-based analysis and synchronization of distributed transactions scheduled by EDF
Nicola Serreli
2010
Corpus ID: 61489382
In this thesis we address the problem of designing and analyzing distributed real time systems modeled as sets of real-time…
Expand
2006
2006
Adaptive Neural Network Control of Nonlinear Systems with Input Nonlinearity
Haibo Jiang
,
Tian-Ping Zhang
,
Jianjiang Yu
,
Caigen Zhou
International Conference on Machine Learning and…
2006
Corpus ID: 1953139
The paper investigates the adaptive neural network control design for a class of nonlinear systems with input nonlinearity using…
Expand
2005
2005
H∞Guaranteed Cost Computation for Uncertain Time-Delay Systems
E. N. Gonçalves
,
S. B. Bastos
,
+4 authors
P. Ekel
Proceedings of the 44th IEEE Conference on…
2005
Corpus ID: 24481581
This paper presents a less conservative approach to compute, with any prescribed accuracy, the H∞guaranteed cost of time-delay…
Expand
Review
2003
Review
2003
System-level timing analysis and scheduling for embedded packet processors
S. Chakraborty
2003
Corpus ID: 2745266
Packet processors are high-performance, programmable devices with special architectural features that are optimized for network…
Expand
2000
2000
Compiler Techniques for Efficiently Implementing Virtual Function Calls Using Predicated Execution in EPIC Architectures
Christopher Sadler
,
Sandeep K. S. Gupta
,
R. Bhatia
2000
Corpus ID: 13907633
The direct costs of virtual function calls in object-oriented programs is a runtime overhead incurred by the number of operations…
Expand
1973
1973
On an alleged contradiction lurking in Frege's Begriffsschrift
T. Bynum
Notre Dame J. Formal Log.
1973
Corpus ID: 41645259
Frege allows a functional letter to occur in a quantifier. . . . The result is that the difference between function and argument…
Expand