Results 271 to 280 of about 1,744,639 (315)
Some of the next articles are maybe not open access.
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
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
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
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
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
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
Constraints, 1996
Recently, interest in constraints and databases has increased significantly as the databases field has started to consider broader application domains. In this short position statement, I identify some of the most promising direcrtions, in my opinion, for the use of constraints in the context of databaes management systems.
openaire +1 more source
Recently, interest in constraints and databases has increased significantly as the databases field has started to consider broader application domains. In this short position statement, I identify some of the most promising direcrtions, in my opinion, for the use of constraints in the context of databaes management systems.
openaire +1 more source
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
Constraint propagation for loose constraint graphs
Proceedings of the 2007 ACM symposium on Applied computing, 2007In this paper we investigate how to improve propagation-based finite domain constraint solving by making use of the constraint graph to choose propagators to execute in a better order. If the constraint graph is not too densely connected we can build an underlying tree of bi-connected components, and use this to order the choice of propagator.
Kathryn Francis, Peter J. Stuckey
openaire +1 more source