1458 search results - page 244 / 292 » Monads for incremental computing |
126
Voted
AAAI
2008
15 years 6 months ago
2008
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
116
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we present the complete design and architectural details of MAIZEROUTER. MAIZEROUTER reflects a significant leap in progress over existing publicly available routing...
130
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
135
click to vote
IJCAI
2007
15 years 5 months ago
2007
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
120
click to vote
AAAI
2006
15 years 5 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...