2899 search results - page 302 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
184
click to vote
CISC
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
180
click to vote
PDP
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
188
click to vote
IPTPS
2003
Springer
15 years 11 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
181
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
165
click to vote
MONET
2008
15 years 6 months ago
2008
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...