88 search results - page 7 / 18 » Solving Non-Boolean Satisfiability Problems with Stochastic ... |
WSC
2004
14 years 11 months ago
2004
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
AAAI
1994
14 years 11 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
EAAI
2007
14 years 9 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
78
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
119
click to vote
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...