1612 search results - page 13 / 323 » Analysing Randomized Distributed Algorithms |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
TMC
2012
11 years 9 months ago
2012
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
COLT
2003
Springer
14 years 18 days ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...