Sciweavers

14649 search results - page 236 / 2930
» Principles of problem solving
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A sparsity based criterion for solving the permutation ambiguity in convolutive blind source separation
In this paper, we present a new algorithm for solving the permutation ambiguity in convolutive blind source separation. A common approach for separation of convolutive mixtures is...
Radoslaw Mazur, Alfred Mertins
VMCAI
2007
Springer
16 years 18 days ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
178
Voted
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
16 years 8 hour ago
The MaxSolve algorithm for coevolution
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliab...
Edwin D. de Jong
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 12 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
CP
2001
Springer
15 years 11 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder