1480 search results - page 142 / 296 » Ants can solve constraint satisfaction problems |
198
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
187
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
151
click to vote
CPAIOR
2007
Springer
16 years 20 days ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
168
click to vote
EOR
2010
15 years 6 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
154
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...