2974 search results - page 183 / 595 » Model-Driven Constraint Programming |
160
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
167
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
165
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
167
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
184
click to vote
ARTS
1999
Springer
15 years 10 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...