Sciweavers

1662 search results - page 86 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
14 years 2 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
DCC
2011
IEEE
13 years 3 months ago
Collaboration in Distributed Hypothesis Testing with Quantized Prior Probabilities
The effect of quantization of prior probabilities in a collection of distributed Bayesian binary hypothesis testing problems over which the priors themselves vary is studied. In ...
Joong Bum Rhim, Lav R. Varshney, Vivek K. Goyal
ATAL
2007
Springer
14 years 3 months ago
Autonomous nondeterministic tour guides: improving quality of experience with TTD-MDPs
In this paper, we address the problem of building a system of autonomous agents for a complex environment, in our case, a museum with many visitors. Visitors may have varying pref...
Andrew S. Cantino, David L. Roberts, Charles L. Is...
AMET
1998
Springer
14 years 1 months ago
Bid Evaluation and Selection in the MAGNET Automated Contracting System
We present an approach to the bid-evaluation problem in a system for multi-agent contract negotiation, called MAGNET. The MAGNET market infrastructure provides support for a variet...
Erik S. Steinmetz, John Collins, Scott Jamison, Ra...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 3 months ago
GAMA (genetic algorithm driven multi-agents)for e-commerce integrative negotiation
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...
Magda Bahaa Eldin Fayek, Ihab A. Talkhan, Khalil S...