10988 search results - page 1940 / 2198 » Algorithmic Folding Complexity |
155
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Multi-issue negotiation protocols represent a promising field since most negotiation problems in the real world involve multiple issues. Our work focuses on negotiation with inte...
141
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
148
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...
138
Voted
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
163
click to vote
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...