Sciweavers

4403 search results - page 246 / 881
» Galois Theory of Algorithms
Sort
View
COMPGEOM
2003
ACM
15 years 12 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
INDOCRYPT
2001
Springer
15 years 11 months ago
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
Harald Baier
ACSD
2007
IEEE
140views Hardware» more  ACSD 2007»
15 years 10 months ago
Synthesis of Petri Nets from Finite Partial Languages
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
Robert Lorenz, Robin Bergenthum, Jörg Desel, ...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 10 months ago
Enhancing the GA's Ability to Cope with Dynamic Environments
: The Shifting Balance Genetic Algorithm (SBGA) is a pluggable module for a GA (or any other Evolutionary Algorithm) based on a modification of Sewall Wright's shifting balanc...
Mark Wineberg, Franz Oppacher