Sciweavers

71228 search results - page 396 / 14246
» Algorithms
Sort
View
EOR
2000
43views more  EOR 2000»
15 years 7 months ago
A framework for the description of evolutionary algorithms
Evolutionary algorithms (EA) are optimisation techniques inspired from natural evolution processes. They handle a population of individuals that evolve with the help of informatio...
Alain Hertz, Daniel Kobler
IJCSS
2000
86views more  IJCSS 2000»
15 years 7 months ago
Discovering hierarchical decision rules with evolutive algorithms in supervised learning
This paper describes a new approach, HIDER (HIerarchical DEcision Rules), for learning rules in continuous and discrete domains based on evolutive algorithms. The algorithm produce...
José Cristóbal Riquelme Santos, Jes&...
IPL
2000
97views more  IPL 2000»
15 years 7 months ago
A fast algorithm for computing large Fibonacci numbers
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
Daisuke Takahashi
JCT
2000
103views more  JCT 2000»
15 years 7 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
15 years 7 months ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür
« Prev « First page 396 / 14246 Last » Next »