Sciweavers

230 search results - page 34 / 46
» Efficient algorithms for acceptable design exploration
Sort
View
SAC
2008
ACM
13 years 7 months ago
Expected energy consumption minimization in DVS systems with discrete frequencies
Energy-efficiency has been an important system issue in hardware and software designs to extend operation duration or cut power bills. This research explores systems with probabil...
Jian-Jia Chen
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 7 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
IJNSEC
2008
106views more  IJNSEC 2008»
13 years 7 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...
MOBIHOC
2010
ACM
13 years 5 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini