584 search results - page 88 / 117 » Efficient mass decomposition |
ASAP
2000
IEEE
14 years 1 months ago
2000
IEEE
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
GECCO
2007
Springer
14 years 24 days ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
E4MAS
2004
Springer
14 years 19 days ago
2004
Springer
Abstract. Decentralised, event-driven distributed simulation is particularly suitable for modelling systems with inherent asynchronous parallelism, such as agentbased systems. Howe...
CRYPTO
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
EEF
2000
14 years 15 days ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...