Sciweavers

1957 search results - page 170 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
NIPS
2007
14 years 11 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
14 years 11 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 10 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
IJCAI
2003
14 years 11 months ago
A Continuation Method for Nash Equilibria in Structured Games
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
Ben Blum, Christian R. Shelton, Daphne Koller
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 10 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang