3928 search results - page 115 / 786 » order 2006 |
112
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
140
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
108
click to vote
INFORMATICALT
2000
15 years 4 months ago
2000
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...
116
click to vote
NAR
2000
15 years 4 months ago
2000
KEYnet is a database where gene and protein names are hierarchically structured. Particular care has been devoted to the search and organisation of synonyms. The structuring is ba...
117
Voted
PR
2000
15 years 4 months ago
2000
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search f...