4488 search results - page 87 / 898 » Focusing Search by Using Problem Solving Experience |
122
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
161
click to vote
ICTAI
2009
IEEE
15 years 28 days ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
121
click to vote
ICTAI
1999
IEEE
15 years 7 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
CG
1998
Springer
15 years 7 months ago
1998
Springer
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
115
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary m. Based on ideas from abstract memory, two scheme...