431 search results - page 10 / 87 » Implementing the maximum of monotone algorithms |
122
click to vote
CCCG
2007
15 years 5 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
122
Voted
ALENEX
2009
15 years 5 months ago
2009
We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...
164
click to vote
FPL
2006
Springer
15 years 7 months ago
2006
Springer
A field-programmable gate array (FPGA) implementation of a new detection algorithm for uncoded multiple inputmultiple output (MIMO) systems based on the complex version of the sph...
128
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
124
Voted
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
— The complexity of Finite Impulse Response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. A greedy Common Subexp...