Sciweavers

846 search results - page 24 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
TON
2010
176views more  TON 2010»
15 years 23 days ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
FOCS
2008
IEEE
16 years 16 days ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
MOBIHOC
2009
ACM
16 years 6 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
15 years 10 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
15 years 3 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...