383 search results - page 14 / 77 » Common Subexpressions in Constraint Models of Planning Probl... |
BMCBI
2010
13 years 7 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
AIPS
2003
13 years 9 months ago
2003
We present a case study in confronting the GPT generalpurpose planner with the challenging power supply restoration (PSR) benchmark for contingent planning. PSR is derived from a ...
CONSTRAINTS
2011
12 years 11 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...