14158 search results - page 136 / 2832 » Generalized switch-setting problems |
120
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
DAM
2006
15 years 2 months ago
2006
A new simple generalization of the Motzkin
109
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
126
Voted
CLA
2007
15 years 4 months ago
2007
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a se...