Sciweavers

4342 search results - page 198 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
153
Voted
CISC
2007
Springer
125views Cryptology» more  CISC 2007»
15 years 11 months ago
Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
Baudoin Collard, François-Xavier Standaert,...
IJCNN
2006
IEEE
15 years 11 months ago
Generalization Improvement in Multi-Objective Learning
— Several heuristic methods have been suggested for improving the generalization capability in neural network learning, most of which are concerned with a single-objective (SO) l...
Lars Gräning, Yaochu Jin, Bernhard Sendhoff
149
Voted
COLT
2005
Springer
15 years 10 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
IPPS
2002
IEEE
15 years 9 months ago
Toward Optimal Diffusion Matrices
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
Robert Elsässer, Burkhard Monien, Günter...
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
15 years 2 months ago
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
João Pedro, João Pires, João ...