874 search results - page 81 / 175 » Faster Algorithms for Semi-Matching Problems |
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
AAAI
2007
15 years 9 days ago
2007
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this...
NIPS
2004
14 years 11 months ago
2004
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
JAIR
2006
14 years 10 months ago
2006
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...