Sciweavers

8874 search results - page 221 / 1775
» A New Implementation of Automath
Sort
View
GPEM
2002
163views more  GPEM 2002»
15 years 6 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
ACIVS
2005
Springer
16 years 5 days ago
A Fast Sequential Rainfalling Watershed Segmentation Algorithm
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
Johan de Bock, Patrick de Smet, Wilfried Philips
JSAC
2006
84views more  JSAC 2006»
15 years 6 months ago
The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new con...
Wojciech Kabacinski, Marek Michalski
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
Matthieu Rivain
COMPSAC
2008
IEEE
16 years 1 months ago
Dealing with the Crosscutting Structure of Software Architectural Styles
Architecture-based software development is the implementation of a software system in terms of its architectural constructs (e.g., components, connectors, ports). It has been show...
Sam Malek