6142 search results - page 142 / 1229 » The Complexity of Partition Functions |
CP
2006
Springer
15 years 1 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
Due to the presence of speckle, segmentation of SAR images is generally acknowledged as a difficult problem. A large effort has been done in order to cope with the influence of sp...
ICCAD
2008
IEEE
15 years 7 months ago
2008
IEEE
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
GPEM
2006
14 years 10 months ago
2006
New Particle Swarm Optimization (PSO) methods for dynamic and noisy function optimization are studied in this paper. The new methods are based on the hierarchical PSO (H-PSO) and a...
ISSAC
1994
Springer
15 years 2 months ago
1994
Springer
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...