Sciweavers

3702 search results - page 318 / 741
» All Pairings Are in a Group
Sort
View
COMPGEOM
1998
ACM
15 years 11 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
GECCO
2007
Springer
147views Optimization» more  GECCO 2007»
15 years 10 months ago
A comparison of evaluation methods in coevolution
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...
Ting-Shuo Yo, Edwin D. de Jong
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
BIBM
2008
IEEE
106views Bioinformatics» more  BIBM 2008»
15 years 8 months ago
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques
The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to pu...
Niranjan Nagarajan, Carl Kingsford
CHES
2008
Springer
151views Cryptology» more  CHES 2008»
15 years 8 months ago
Binary Edwards Curves
Abstract. This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formula...
Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Fa...