Sciweavers

383 search results - page 43 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
NECO
2008
83views more  NECO 2008»
13 years 7 months ago
Sequential Fixed-Point ICA Based on Mutual Information Minimization
A new gradient technique is introduced for linear ICA based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point itera...
Marc M. Van Hulle
ICS
2007
Tsinghua U.
14 years 1 months ago
Representation-transparent matrix algorithms with scalable performance
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...
Peter Gottschling, David S. Wise, Michael D. Adams
AI
2005
Springer
13 years 7 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
ICCV
2009
IEEE
13 years 5 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li