2863 search results - page 369 / 573 » Constructing minimum-interference networks |
113
Voted
ESANN
2007
15 years 5 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...
230
Voted
AIPS
2004
15 years 5 months ago
2004
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
133
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
129
Voted
ESANN
2006
15 years 5 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
111
Voted
FLAIRS
2001
15 years 5 months ago
2001
When constructing a Bayesian network, it can be advantageous to employ structural learning algorithms to combine knowledge captured in databases with prior information provided by...