1647 search results - page 119 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
165
Voted
JCP
2007
15 years 4 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
144
Voted
TCOM
2010
15 years 3 months ago
2010
Abstract—This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
155
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
301
click to vote
CVPR
2009
IEEE
17 years 1 days ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
134
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...