236 search results - page 18 / 48 » Learning Teleoreactive Logic Programs from Problem Solving |
132
Voted
JMLR
2012
13 years 4 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
116
click to vote
ATMOS
2007
15 years 3 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
135
click to vote
AI
2007
Springer
15 years 2 months ago
2007
Springer
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
114
click to vote
LPAR
2010
Springer
15 years 2 days ago
2010
Springer
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
EH
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...