Sciweavers

2900 search results - page 443 / 580
» On the Convergence of Immune Algorithms
Sort
View
ATAL
2006
Springer
15 years 9 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
3DIM
2003
IEEE
15 years 9 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
NIPS
2007
15 years 7 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 7 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
BMCBI
2010
150views more  BMCBI 2010»
15 years 6 months ago
Evolutionary rates at codon sites may be used to align sequences and infer protein domain function
Background: Sequence alignments form part of many investigations in molecular biology, including the determination of phylogenetic relationships, the prediction of protein structu...
Pierre M. Durand, Scott Hazelhurst, Theresa L. Coe...