5138 search results - page 465 / 1028 » Randomized Algorithms for 3-SAT |
144
click to vote
UC
2005
Springer
16 years 10 days ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
217
click to vote
HICSS
2002
IEEE
15 years 12 months ago
2002
IEEE
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
149
click to vote
NIPS
2007
15 years 8 months ago
2007
This paper studies boosting algorithms that make a single pass over a set of base classifiers. We first analyze a one-pass algorithm in the setting of boosting with diverse base...
168
click to vote
EOR
2010
15 years 7 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
198
click to vote
DEBU
2010
15 years 4 months ago
2010
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...