Sciweavers

AAECC
2003
Springer
104views Algorithms» more  AAECC 2003»
14 years 3 months ago
Interpolation of the Elliptic Curve Diffie-Hellman Mapping
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
Tanja Lange, Arne Winterhof
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
14 years 3 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye
GECCO
2006
Springer
192views Optimization» more  GECCO 2006»
14 years 3 months ago
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
14 years 3 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon
GECCO
2006
Springer
140views Optimization» more  GECCO 2006»
14 years 3 months ago
A representational ecology for learning classifier systems
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
James A. R. Marshall, Tim Kovacs
GECCO
2006
Springer
140views Optimization» more  GECCO 2006»
14 years 3 months ago
Prediction update algorithms for XCSF: RLS, Kalman filter, and gain adaptation
We study how different prediction update algorithms influence the performance of XCSF. We consider three classical parameter estimation algorithms (NLMS, RLS, and Kalman filter) a...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
14 years 3 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
FSTTCS
2006
Springer
14 years 3 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
ESOA
2006
14 years 3 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...