1921 search results - page 157 / 385 » Stereo Without Search |
121
click to vote
AIPS
2008
15 years 6 months ago
2008
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution ...
150
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
131
click to vote
CP
2008
Springer
15 years 6 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...
124
click to vote
AAAI
2010
15 years 5 months ago
2010
The aim of General Game Playing (GGP) is to create intelligent agents that can automatically learn how to play many different games at an expert level without any human interventi...
158
click to vote
DBSEC
2008
15 years 5 months ago
2008
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client si...