1844 search results - page 162 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
177
Voted
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
180
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
158
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
141
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
With the employment of cognitive radio technology, dynamic spectrum management has the potential to solve the underused spectrum problem. In this paper, we introduce and compare tw...
160
Voted
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...