4524 search results - page 228 / 905 » The Complexity of Global Constraints |
133
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
184
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
We present a new knowledge-based Model Quality Assessment Program (MQAP) at the residue level which evaluates single protein structure models. We use a tree representation of the ...
158
click to vote
WDAG
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...
181
click to vote
CGF
2004
15 years 6 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...