2356 search results - page 188 / 472 » Characterizations of postman sets |
226
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
199
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
166
click to vote
ECOOPW
1997
Springer
15 years 10 months ago
1997
Springer
An object-oriented (OO) model has a static component, the set of allowable snapshots or system states, and a dynamic component, the set of filmstrips or sequences of snapshots. Dia...
140
click to vote
IUI
1993
ACM
15 years 10 months ago
1993
ACM
The goal of this paper is to model an agent who dislikes large choice sets because of the “cost of thinking” involved in choosing from them. We take as a primitive a preferenc...
175
click to vote
AAAI
2008
15 years 9 months ago
2008
A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all ...