76 search results - page 15 / 16 » Monte-Carlo Tree Search Solver |
CP
2000
Springer
13 years 10 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
CONSTRAINTS
2006
13 years 6 months ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
AUSDM
2007
Springer
14 years 12 days ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
AAAI
2008
13 years 8 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
CP
2003
Springer
13 years 11 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...