1418 search results - page 87 / 284 » How to Explain Mistakes |
MOZ
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
ECP
1997
Springer
14 years 2 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
FOSAD
2000
Springer
14 years 1 months ago
2000
Springer
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
ANOR
2005
13 years 9 months ago
2005
In this paper we consider a game-theoretic dynamic model describing the exploitation of a renewable resource. Our model is based on a Cournot oligopoly game where n profit-maximizi...
CSUR
2000
13 years 9 months ago
2000
The goal of this paper is to illustrate how frameworks and patterns address complexities that arise in the design and implementation of high-performance distributed software syste...