7106 search results - page 371 / 1422 » Restricted Complexity, General Complexity |
184
Voted
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
178
Voted
TCS
2010
15 years 26 days ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
177
click to vote
ECCC
2011
14 years 9 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
160
click to vote
SIGACT
2008
15 years 6 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
190
click to vote
CI
2005
15 years 6 months ago
2005
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...