87 search results - page 10 / 18 » A Theoretical Comparison of Monte Carlo Radiosity Algorithms |
130
click to vote
TKDE
2012
13 years 2 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper proposes a new blind algorithm, based on Mixture Kalman Filtering (MKF), for joint carrier recovery and channel estimation in time-selective Rayleigh fading channels. M...
101
Voted
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
96
Voted
UAI
2008
15 years 1 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
AAAI
1998
15 years 1 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...