7303 search results - page 211 / 1461 » Optimality for dynamic patterns |
109
click to vote
NIPS
2007
15 years 4 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
117
Voted
MVA
1998
15 years 4 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
119
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
138
Voted
TKDE
2008
15 years 3 months ago
2008
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
105
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...