Sciweavers

5153 search results - page 449 / 1031
» Introduction to Randomized Algorithms
Sort
View
UC
2005
Springer
15 years 11 months ago
Quantum Searching Amidst Uncertainty
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 ...
Lov K. Grover
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
15 years 11 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
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...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
NIPS
2007
15 years 7 months ago
One-Pass Boosting
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...
Zafer Barutçuoglu, Philip M. Long, Rocco A....
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
ICCMS
2009
118views more  ICCMS 2009»
15 years 4 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi