Sciweavers

12825 search results - page 59 / 2565
» Improved PLSOM algorithm
Sort
View
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
15 years 8 months ago
Improving EA-based design space exploration by utilizing symbolic feasibility tests
This paper will propose a novel approach in combining Evolutionary Algorithms with symbolic techniques in order to improve the convergence of the algorithm in the presence of larg...
Thomas Schlichter, Christian Haubelt, Jürgen ...
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
15 years 7 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 6 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
ICASSP
2011
IEEE
14 years 6 months ago
Improving the performance of DSP systems for MIMO processing
While the research into MIMO communications algorithms have reached levels of development that show important wireless systems performance improvements, the development of DSP sys...
Nathaniel Horner, Andres Kwasinski, Antonio Mondra...
AI
2007
Springer
15 years 8 months ago
Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
Changhe Yuan, Marek J. Druzdzel