3204 search results - page 412 / 641 » Online Learning with Constraints |
298
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
194
click to vote
ICB
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...
168
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
167
click to vote
FC
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
202
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...