1647 search results - page 221 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
124
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
192
click to vote
TELSYS
2011
14 years 9 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
EH
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
183
Voted
PODS
2009
ACM
16 years 3 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
131
click to vote
ML
1998
ACM
15 years 2 months ago
1998
ACM
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...