Sciweavers

1523 search results - page 213 / 305
» The Computational Complexity of Linear Optics
Sort
View
CN
2006
75views more  CN 2006»
13 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
MST
2010
140views more  MST 2010»
13 years 8 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
CANS
2010
Springer
197views Cryptology» more  CANS 2010»
13 years 7 months ago
Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
Bozhan Su, Wenling Wu, Shuang Wu, Le Dong
GLOBECOM
2010
IEEE
13 years 7 months ago
Maximization of Data Gathering in Clustered Wireless Sensor Networks
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
TCAD
2010
168views more  TCAD 2010»
13 years 4 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha