663 search results - page 59 / 133 » On the Foundations of Expected Expected Utility |
136
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
155
click to vote
KR
1994
Springer
15 years 10 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
192
click to vote
PPCP
1993
15 years 10 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
155
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
145
click to vote
APSEC
2004
IEEE
15 years 10 months ago
2004
IEEE
Many routing protocols for wireless sensor network have been proposed, with the purpose of achieving efficient routing. However, when the mobility increases rapidly and the networ...