4432 search results - page 710 / 887 » Solving Demodulation as an Optimization Problem |
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
93
Voted
STACS
2004
Springer
15 years 6 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
75
Voted
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
144
click to vote
ICS
2005
Tsinghua U.
15 years 6 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
124
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...