4403 search results - page 195 / 881 » Galois Theory of Algorithms |
138
click to vote
ISAAC
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
140
click to vote
COMPGEOM
2006
ACM
16 years 13 days ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
160
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
This contribution proposes an enhanced and generic selection model for Genetic Algorithms (GAs) and Genetic Programming (GP) which is able to preserve the alleles which are part o...
185
click to vote
ANTS
1998
Springer
15 years 10 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
172
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...