Sciweavers

1529 search results - page 84 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
MIA
2010
170views more  MIA 2010»
14 years 10 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
AAAI
2004
15 years 5 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
131
Voted
BMCBI
2007
128views more  BMCBI 2007»
15 years 4 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
15 years 7 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
CSDA
2007
169views more  CSDA 2007»
15 years 3 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu