1389 search results - page 150 / 278 » Improved Approximation Algorithms for Label Cover Problems |
131
click to vote
ICML
2002
IEEE
16 years 4 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
145
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
WIA
2005
Springer
15 years 8 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
146
click to vote
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
176
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Multi-instance multi-label learning (MIML) refers to the
learning problems where each example is represented by a
bag/collection of instances and is labeled by multiple labels.
...