3049 search results - page 146 / 610 » On the Convergence of Bound Optimization Algorithms |
160
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
141
click to vote
ATS
2001
IEEE
15 years 8 months ago
2001
IEEE
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
137
click to vote
NIPS
2008
15 years 6 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
126
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential f...
123
click to vote
IJCAI
2001
15 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...