4903 search results - page 152 / 981 » The Set Covering Machine |
AGI
2011
13 years 28 days ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
CSFW
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...