14774 search results - page 280 / 2955 » Computational complexity and evolutionary computation |
151
click to vote
ESANN
2007
15 years 8 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
185
click to vote
IADIS
2004
15 years 8 months ago
2004
Construction kits represent a venerable, creative, and (occasionally) even beautiful genre of educational toys for children. Nonetheless, traditional construction kits have limita...
166
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
137
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
Understanding shapes has been a challenging issue for many years, firstly motivated by computer vision and more recently by many complex applications in diverse fields, such as me...
189
click to vote
CSJM
2006
15 years 6 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...