Sciweavers

1456 search results - page 75 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
SPAA
2010
ACM
14 years 11 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
IMSCCS
2007
IEEE
15 years 5 months ago
Asymmetric Bagging and Feature Selection for Activities Prediction of Drug Molecules
Background: Activities of drug molecules can be predicted by QSAR (quantitative structure activity relationship) models, which overcomes the disadvantages of high cost and long cy...
Guo-Zheng Li, Hao-Hua Meng, Mary Qu Yang, Jack Y. ...
INFOCOM
2011
IEEE
14 years 2 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
15 years 3 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
PPSN
2010
Springer
14 years 9 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...