Results 251 to 260 of about 4,903,796 (298)
Some of the next articles are maybe not open access.
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.
J.L. Fan, null T Lei Poo, B.H. Marcus
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.
J.L. Fan, null T Lei Poo, B.H. Marcus
openaire +1 more source
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
Constraint Relationships for Soft Constraints
2013We introduce constraint relationships as a means to define qualitative preferences on the constraints of soft constraint problems. The approach is aimed at constraint satisfaction problems (CSPs) with a high number of constraints that make exact preference quantizations hard to maintain manually or hard to anticipate—especially if constraints or ...
Schiendorfer, Alexander +4 more
openaire +2 more sources
Operations Research, 1968
A surrogate constraint is an inequality implied by the constraints of an integer program, and designed to capture useful information that cannot be extracted from the parent constraints individually but is nevertheless a consequence of their conjunction.
openaire +2 more sources
A surrogate constraint is an inequality implied by the constraints of an integer program, and designed to capture useful information that cannot be extracted from the parent constraints individually but is nevertheless a consequence of their conjunction.
openaire +2 more sources
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 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 Witkin, Michael Kass
openaire +1 more source
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\).
Burke, James V., Moré, Jorge J.
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\).
Burke, James V., Moré, Jorge J.
openaire +2 more sources
The importance of constraints on constraints
Behavioral and Brain Sciences, 2020Abstract The “resource-rational” approach is ambitious and worthwhile. A shortcoming of the proposed approach is that it fails to constrain what counts as a constraint. As a result, constraints used in different cognitive domains often have nothing in common.
Christopher J. Bates +2 more
openaire +2 more sources