36781 search results - page 286 / 7357 » Parameterizing by the Number of Numbers |
153
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
166
Voted
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
184
Voted
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
160
Voted
GPEM
2006
15 years 6 months ago
2006
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
234
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...