1662 search results - page 173 / 333 » The Computational Complexity of Agent Design Problems |
252
click to vote
Publication
In this paper, we seek to design a Groves mechanism for
assigning p heterogeneous objects among n competing agents (n > p)
with unit demand, satisfying weak budget balance, in...
147
click to vote
ISMB
1993
15 years 5 months ago
1993
Interactions that determinecellular fate are exceedingly complex, can take place at different levels of gene regulation and involve a large numberof components(such as genes, prot...
135
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
137
click to vote
ICECCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Mobile code systems provide an infrastructure that supports autonomous mobile components, called mobile agents. The infrastructure implements services for the transfer, execution,...
117
click to vote
CIMCA
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we present a simple yet accurate model to forecast electricity load with Artificial Neural Networks (ANNs). We analyze the problem domain and choose the most adequat...