Sciweavers

3433 search results - page 226 / 687
» Heuristics for a bidding problem
Sort
View
BMCBI
2008
125views more  BMCBI 2008»
15 years 6 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
SADM
2008
178views more  SADM 2008»
15 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
CVPR
2010
IEEE
15 years 3 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
EVOW
2009
Springer
16 years 1 months ago
Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
Xiaomin Hu, Jun Zhang, Li-Ming Zhang
ATAL
2007
Springer
16 years 25 days ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser