1554 search results - page 132 / 311 » Parameterized Complexity and Approximation Algorithms |
110
Voted
IWINAC
2007
Springer
15 years 9 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
141
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
132
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
157
Voted
JCSS
2008
15 years 3 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
138
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...