Sciweavers

EC
2008
103views ECommerce» more  EC 2008»
13 years 11 months ago
A Graphical Model for Evolutionary Optimization
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...
Christopher K. Monson, Kevin D. Seppi
EAAI
2008
106views more  EAAI 2008»
13 years 11 months ago
The distributed multilevel ant-stigmergy algorithm used at the electric-motor design
This article presents an optimization method used at the electric-motor design. The goal of the optimization was to find the geometrical parameter values that would generate the r...
Peter Korosec, Jurij Silc
ADHOC
2006
116views more  ADHOC 2006»
13 years 11 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
AAI
2006
71views more  AAI 2006»
13 years 11 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
AAECC
2006
Springer
125views Algorithms» more  AAECC 2006»
13 years 11 months ago
Combinatorial Group Theory and Public Key Cryptography
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
Vladimir Shpilrain, Gabriel Zapata
AAECC
2006
Springer
132views Algorithms» more  AAECC 2006»
13 years 11 months ago
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
Vladimir Shpilrain, Alexander Ushakov
AAECC
2006
Springer
109views Algorithms» more  AAECC 2006»
13 years 11 months ago
Cryptosystems using Linear Groups
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
Gilbert Baumslag, Benjamin Fine, Xiaowei Xu
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
13 years 11 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 11 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl