18306 search results - page 3253 / 3662 » Algorithmics in Exponential Time |
131
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
117
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
135
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
140
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
140
Voted
DPD
2006
15 years 3 months ago
2006
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solu...