8824 search results - page 120 / 1765 » On the Complexity of Real Functions |
112
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
122
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
138
click to vote
COMPLEX
2009
Springer
15 years 11 months ago
2009
Springer
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
154
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
125
click to vote
CG
2002
Springer
15 years 4 months ago
2002
Springer
The difficulty to write successful 19x19 go programs lies not only in the combinatorial complexity of go but also in the complexity of designing a good evaluation function containi...