889 search results - page 126 / 178 » A computational model of achievement motivation for artifici... |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Investigations of multi-robot systems often make implicit assumptions concerning the computational capabilities of the robots. Despite the lack of explicit attention to the comput...
KES
2004
Springer
14 years 1 months ago
2004
Springer
A "chance" is an event or a situation significant for making a decision in a complex environment. Since we organized a session of Chance Discovery in KES 2000, the basic...
CIA
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we propose a probabilistic framework targeting three important issues in the computation of quality and trust in decentralized systems. Specifically, our approach a...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Software agents help automate a variety of tasks including those involved in buying and selling products over the internet. The need for handling complex highly configurable produ...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...