317 search results - page 32 / 64 » Improving Planning Performance Using Low-Conflict Relaxed Pl... |
MMSEC
2006
ACM
14 years 3 months ago
2006
ACM
In this paper, we suggest an optimization approach for fingerprint authentication using genetic algorithms. Our application was planned so that it can be used without great effort...
AIPS
2010
13 years 11 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
NIPS
2003
13 years 10 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
SIGMOD
1996
ACM
14 years 1 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
ASE
1998
13 years 8 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...