4432 search results - page 415 / 887 » Solving Demodulation as an Optimization Problem |
118
click to vote
CPM
2003
Springer
15 years 9 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
144
Voted
INFOCOM
1999
IEEE
15 years 9 months ago
1999
IEEE
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
130
click to vote
ISPD
1998
ACM
15 years 8 months ago
1998
ACM
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
182
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
145
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....