4526 search results - page 126 / 906 » Algorithmic problems related to the Internet |
142
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
141
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
142
click to vote
ASIACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
130
Voted
SWSTE
2005
IEEE
15 years 9 months ago
2005
IEEE
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ï¬...
109
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...