Sciweavers

174 search results - page 22 / 35
» Permutation Groups in NC
Sort
View
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
15 years 8 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
88
Voted
ICRA
2006
IEEE
127views Robotics» more  ICRA 2006»
15 years 8 months ago
Controlling three Dimensional Swarms of Robots
— We address the problem of modeling and controlling a swarm of fully actuated point-like robots in three dimensions by generalizing the planar framework from [1]. We define a e...
Nathan Michael, Calin Belta, Vijay Kumar
121
Voted
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 2 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
64
Voted
CRYPTOLOGIA
2007
53views more  CRYPTOLOGIA 2007»
15 years 1 months ago
Rejewski's Catalog
When attacking the German Enigma cipher machine during the 1930s, the Polish mathematician Marian Rejewski developed a catalog of disjoint cycles of permutations generated by Enigm...
Alex Kuhl
ICISS
2009
Springer
14 years 11 months ago
On Some Weaknesses in the Disk Encryption Schemes EME and EME2
Abstract. Tweakable enciphering schemes are a certain type of blockcipher mode of operation which provide security in the sense of a strong pseudo-random permutation. It has been p...
Cuauhtemoc Mancillas-López, Debrup Chakrabo...