Sciweavers

2157 search results - page 43 / 432
» Binary ant algorithm
Sort
View
GECCO
2005
Springer
203views Optimization» more  GECCO 2005»
14 years 2 months ago
Ant colony optimization for power plant maintenance scheduling optimization
In order to maintain a reliable and economic electric power supply, the maintenance of power plants is becoming increasingly important. In this paper, a formulation that enables a...
Wai-Kuan Foong, Holger R. Maier, Angus R. Simpson
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 1 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
14 years 1 months ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
13 years 10 months ago
Abelian Varieties with Prescribed Embedding Degree
We present an algorithm that, on input of a CM-field K, an integer k 1, and a prime r 1 mod k, constructs a q-Weil number OK corresponding to an ordinary, simple abelian variety ...
David Freeman, Peter Stevenhagen, Marco Streng
ANTS
2008
Springer
103views Algorithms» more  ANTS 2008»
13 years 10 months ago
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
Koray Karabina, Edlyn Teske