1298 search results - page 77 / 260 » The online set cover problem |
148
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
The authors propose a co-adaptive approach to controlling parameters for coevolution-based learning classifier systems. By taking advantage of the on-line incremental learning capa...
146
click to vote
SIGECOM
2006
ACM
16 years 10 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
286
click to vote
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...
134
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
155
click to vote
ICMLA
2007
15 years 7 months ago
2007
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...