Sciweavers

837 search results - page 33 / 168
» Hard combinators
Sort
View
92
Voted
IWINAC
2007
Springer
15 years 4 months ago
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern&aa...
DOCENG
2006
ACM
15 years 4 months ago
Mash-o-matic
Mash-ups extract data fragments from disparate sources, and combine and transform the extracted fragments for display. Currently, mash-up developers tend to employ ad hoc represen...
Sudarshan Murthy, David Maier, Lois M. L. Delcambr...
DATE
2005
IEEE
121views Hardware» more  DATE 2005»
15 years 3 months ago
Joint Power Management of Memory and Disk
This paper presents a scheme to combine memory and power management for achieving better energy reduction. Our method periodically adjusts the size of physical memory and the time...
Le Cai, Yung-Hsiang Lu
95
Voted
PKC
2005
Springer
192views Cryptology» more  PKC 2005»
15 years 3 months ago
Securing RSA-KEM via the AES
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...
Jakob Jonsson, Matthew J. B. Robshaw
UML
2005
Springer
15 years 3 months ago
Addressing Domain Evolution Challenges in Software Product Lines
It is hard to develop and evolve software product-line architectures (PLAs) for large-scale distributed real-time and embedded (DRE) systems. Although certain challenges of PLAs ca...
Gan Deng, Gunther Lenz, Douglas C. Schmidt