192 search results - page 6 / 39 » Comparing two approaches to dynamic, distributed constraint ... |
JMLR
2012
11 years 10 months ago
2012
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
EMO
2009
Springer
14 years 2 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Increasing scale, dynamism, and complexity of hybrid grids make traditional grid resource scheduling approaches difficult. In such grids, where resource volatility and dynamism is...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...