2479 search results - page 249 / 496 » Quantum complexity theory |
220
click to vote
DALT
2005
Springer
16 years 6 days ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
166
click to vote
GECCO
2005
Springer
16 years 6 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 ...
234
click to vote
TLCA
2005
Springer
16 years 4 days 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...
163
click to vote
SIGECOM
2004
ACM
16 years 3 days 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...
173
click to vote
ESAW
2004
Springer
16 years 2 days 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...