3096 search results - page 213 / 620 » The Generalized FITC Approximation |
181
click to vote
EMNLP
2006
15 years 6 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
134
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
140
click to vote
NC
1998
15 years 6 months ago
1998
In this paper a new approach for approximation problems involving only few input and output parameters is presented and compared to traditional Backpropagation Neural Networks (BP...
184
click to vote
NETWORKING
2000
15 years 6 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
159
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...