Results 221 to 230 of about 917,424 (269)
Some of the next articles are maybe not open access.
Constraints and Constraint Solving: An Introduction
2001The central idea of constraints is to compute with descriptions of data instead of to compute with data items. Generally speaking, a constraint-based computation mechanism (in a broad sense, this includes for instance deduction calculi and grammar formalisms) can be seen as a two-tired architecture, consisting of A language of data descriptions ...
Jean-Pierre Jouannaud, Ralf Treinen
openaire +1 more source
The Virtuality of Constraints and the Constraints of Virtuality
Constraints, 1996We propose to extend current Constraint Logic Programming techniques and to export them from their classical Logic Programming setting to more conventional and widely used paradigms, such as the Java language. We also advocate for the use of constraints in new types of applications such as 3D graphics and Virtual Reality systems.
openaire +1 more source
Bioinformatics and Constraints
Constraints, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Backofen, Rolf, Gilbert, D.
openaire +2 more sources
A Global Constraint Combining a Sum Constraint and Difference Constraints
2000This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = Σxi, and where variables xi are subject to difference constraints of the form xj - xi ≤ c.
Jean-Charles Régin, Michel Rueher
openaire +1 more source
IEEE Transactions on Information Theory, 2003
In digital storage systems where the input to the noisy channel is required to satisfy a modulation constraint, the constrained code and error-control code (ECC) are typically designed and decoded independently. The achievable rate for this situation is evaluated as the rate of average intersection of the constraint and the ECC.
John L. Fan +2 more
openaire +1 more source
In digital storage systems where the input to the noisy channel is required to satisfy a modulation constraint, the constrained code and error-control code (ECC) are typically designed and decoded independently. The achievable rate for this situation is evaluated as the rate of average intersection of the constraint and the ECC.
John L. Fan +2 more
openaire +1 more source
Set constraints: A pearl in research on constraints
1997The topic of set constraints is a pearl among the research topics on constraints. It combines theoretical investigations (ranging from logical expressiveness, decidability, algorithms and complexity analysis to program semantics and domain theory) with practical experiments in building systems for program analysis, addressing questions like ...
Pacholski, Leszek, Podelski, Andreas
openaire +3 more sources
Science and Engineering Ethics, 2013
Building on research in anthropology and philosophy, one can make a distinction between type I and type II energy ethics as a framework for advancing public debate about energy. Type I holds energy production and use as a fundamental good and is grounded in the assumption that increases in energy production and consumption result in increases in human ...
Carl Mitcham, Jessica Smith Rolston
openaire +2 more sources
Building on research in anthropology and philosophy, one can make a distinction between type I and type II energy ethics as a framework for advancing public debate about energy. Type I holds energy production and use as a fundamental good and is grounded in the assumption that increases in energy production and consumption result in increases in human ...
Carl Mitcham, Jessica Smith Rolston
openaire +2 more sources
SIAM Journal on Optimization, 1994
The aim of an identification result for a linearly constrained problem is to show that if the sequence generated by an optimization algorithm converges to a stationary point, then there is a nontrivial face \(F\) of the feasible set such that after a finite number of iterations, the iterates enter and remain in the face \(F\).
James V. Burke, Jorge J. Moré
openaire +2 more sources
The aim of an identification result for a linearly constrained problem is to show that if the sequence generated by an optimization algorithm converges to a stationary point, then there is a nontrivial face \(F\) of the feasible set such that after a finite number of iterations, the iterates enter and remain in the face \(F\).
James V. Burke, Jorge J. Moré
openaire +2 more sources
Abstracting Constraints Using Constraints
2003Abstraction is a process where problems are modified in some way to make them easier to solve. For our purposes, we look at abstraction as adding constraints in such a manner as to reduce the number of solutions, or removing constraints in order to make more solutions valid. It is a form of simplification, where certain details of a problem are ignored,
openaire +1 more source
Proceedings of the 15th annual conference on Computer graphics and interactive techniques, 1988
Spacetime constraints are a new method for creating character animation. The animator specifies what the character has to do, for instance, "jump from here to there, clearing a hurdle in between;" how the motion should be performed, for instance "don't waste energy," or "come down hard enough
Andrew P. Witkin, Michael Kass
openaire +1 more source
Spacetime constraints are a new method for creating character animation. The animator specifies what the character has to do, for instance, "jump from here to there, clearing a hurdle in between;" how the motion should be performed, for instance "don't waste energy," or "come down hard enough
Andrew P. Witkin, Michael Kass
openaire +1 more source