14649 search results - page 327 / 2930 » Principles of problem solving |
169
click to vote
ISHPC
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
176
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
177
click to vote
ACSC
2008
IEEE
15 years 8 months ago
2008
IEEE
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
193
click to vote
EUROGP
2010
Springer
15 years 8 months ago
2010
Springer
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
172
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...