Sciweavers

2323 search results - page 133 / 465
» Power optimization for connectivity problems
Sort
View
195
Voted
RTSS
1998
IEEE
15 years 9 months ago
Synthesis Techniques for Low-Power Hard Real-Time Systems on Variable Voltage Processors
The energy efficiency of systems-on-a-chip can be much improved if one were to vary the supply voltage dynamically at run time. In this paper we describe the synthesis of systems-...
Inki Hong, Gang Qu, Miodrag Potkonjak, Mani B. Sri...
GLOBECOM
2008
IEEE
15 years 11 months ago
Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
JAIR
2007
141views more  JAIR 2007»
15 years 4 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 10 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
SAT
2009
Springer
126views Hardware» more  SAT 2009»
15 years 11 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia