Sciweavers

1159 search results - page 75 / 232
» On The Next Move in Programming
Sort
View
104
Voted
ICML
2007
IEEE
16 years 1 months ago
A permutation-augmented sampler for DP mixture models
We introduce a new inference algorithm for Dirichlet process mixture models. While Gibbs sampling and variational methods focus on local moves, the new algorithm makes more global...
Percy Liang, Michael I. Jordan, Benjamin Taskar
ACCV
2007
Springer
15 years 6 months ago
Multi-posture Human Detection in Video Frames by Motion Contour Matching
In the paper, we proposed a method for moving human detection in video frames by motion contour matching. Firstly, temporal and spatial difference of frames is calculated and conto...
Qixiang Ye, Jianbin Jiao, Hua Yu
99
Voted
AAAI
1994
15 years 1 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
EOR
2006
70views more  EOR 2006»
15 years 17 days ago
Search allocation game
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
Ryusuke Hohzaki
92
Voted
IEEECIT
2010
IEEE
14 years 11 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan