4255 search results - page 296 / 851 » On Learning Boolean Functions |
156
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
223
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
164
Voted
ESANN
2003
15 years 8 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
169
click to vote
IJON
2007
15 years 6 months ago
2007
It has been unclear whether optimal experimental design accounts of data selection may offer insight into evidence acquisition tasks in which the learner’s beliefs change greatl...
152
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...