4544 search results - page 721 / 909 » Reinforcement Learning with Time |
141
Voted
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
142
click to vote
DICTA
2007
15 years 6 months ago
2007
Active appearance model efficiently aligns objects which are previously modelized in images. We use it for Human Machine Interface (face gesture analysis, lips reading) to modeli...
128
click to vote
AAAI
2006
15 years 6 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
127
Voted
IWEC
2004
15 years 6 months ago
2004
Unsupervised online learning in commercial computer games allows computer-controlled opponents to adapt to the way the game is being played. As such it provides a mechanism to deal...
128
Voted
SODA
2001
ACM
15 years 6 months ago
2001
ACM
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...