5153 search results - page 779 / 1031 » Introduction to Randomized Algorithms |
137
Voted
ENC
2005
IEEE
15 years 9 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
95
Voted
ICDCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
132
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
121
Voted
QEST
2005
IEEE
15 years 9 months ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
127
Voted
SRDS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...