526 search results - page 25 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
AI
1999
Springer
14 years 9 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
AIPS
2006
14 years 11 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
73
Voted
AAAI
1990
14 years 10 months ago
1990
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...