1968 search results - page 84 / 394 » The Complexity of Valued Constraint Models |
203
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
119
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
109
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
106
click to vote
KDD
2002
ACM
16 years 1 months ago
2002
ACM
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...
104
click to vote
SKG
2006
IEEE
15 years 7 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...