2711 search results - page 124 / 543 » Convergence of the Wake-Sleep Algorithm |
162
click to vote
SAC
2011
ACM
14 years 6 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
169
click to vote
ICNC
2009
Springer
15 years 8 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
133
click to vote
TSMC
2002
15 years 3 months ago
2002
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
112
click to vote
ICCAD
2003
IEEE
16 years 24 days ago
2003
IEEE
We have created a stochastic impulse-response (IR) momentextraction algorithm for RC circuit networks. It employs a newly discovered Feynman Sum-over-Paths Postulate. Full paralle...
110
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
The issue of coalition formation has been investigated from many aspects, but until recently little attention has been paid to overlapping coalition formation. What’s more, an a...