2233 search results - page 208 / 447 » On the Complexity of Theory Curbing |
163
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
229
click to vote
TLCA
2005
Springer
16 years 1 hour ago
2005
Springer
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
159
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
165
click to vote
ESAW
2004
Springer
15 years 12 months ago
2004
Springer
The development of multi-agent systems (MAS) implies considering both the social and individual levels of these systems. However, the elements in these levels are not necessarily c...
201
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...