6894 search results - page 54 / 1379 » Generation Problems |
162
click to vote
VL
2007
IEEE
16 years 8 days ago
2007
IEEE
While using how-to documents for guidance in performing computer-based tasks, users often run into problems due to inaccurate, out-of-date and incomplete documentation. These prob...
155
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
154
click to vote
CATS
2008
15 years 7 months ago
2008
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
143
click to vote
JUCS
2008
15 years 6 months ago
2008
: One of the key problems in developing standard based adaptive courses is the complexity involved in the design phase, especially when establishing the hooks for the dynamic model...
168
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...