4255 search results - page 346 / 851 » On Learning Boolean Functions |
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...
187
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
180
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
181
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
179
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we consider the energy-efficient resource allocation that minimizes a general cost function of average user powers in wireless networks. A class of so-called -fair c...