Sciweavers

47 search results - page 7 / 10
» Genetic Algorithms for Automated Negotiations: A FSM-Based A...
Sort
View
ICCBR
2003
Springer
14 years 20 days ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel
ATAL
2006
Springer
13 years 11 months ago
A comparison between mechanisms for sequential compute resource auctions
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...
Andrew Byde
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
14 years 1 months ago
Parameter sweeps for exploring GP parameters
This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and...
Michael E. Samples, Jason M. Daida, Matthew J. Byo...
AIPS
2010
13 years 7 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger
WWW
2003
ACM
14 years 8 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon