4426 search results - page 338 / 886 » Concurrent Constraint Programming |
170
click to vote
RECOMB
1997
Springer
15 years 10 months ago
1997
Springer
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
163
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...
177
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...
169
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...
176
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...