2745 search results - page 58 / 549 » A fast algorithm for computing large Fibonacci numbers |
152
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
132
Voted
TEC
2002
15 years 3 months ago
2002
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
108
Voted
EOR
2007
15 years 3 months ago
2007
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
141
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
132
Voted
ICDCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...