38 search results - page 5 / 8 » Algorithmic Complexity with Page-Based Intelligent Memory |
AAMAS
2010
Springer
13 years 7 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
AAAI
2000
13 years 8 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
AAAI
2007
13 years 9 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
MICAI
2004
Springer
14 years 24 days ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...