2168 search results - page 138 / 434 » Randomized Algorithms and Complexity Theory |
106
click to vote
FUN
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
137
click to vote
AAAI
1993
15 years 4 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
141
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
153
click to vote
PODS
2005
ACM
16 years 3 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
138
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...