Sciweavers

1576 search results - page 73 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
JMLR
2010
129views more  JMLR 2010»
13 years 4 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
EMO
2005
Springer
126views Optimization» more  EMO 2005»
14 years 3 months ago
The Evolution of Optimality: De Novo Programming
Abstract. Evolutionary algorithms have been quite effective in dealing with single-objective “optimization” while the area of Evolutionary Multiobjective Optimization (EMOO) h...
Milan Zeleny
ISCAS
1999
IEEE
70views Hardware» more  ISCAS 1999»
14 years 2 months ago
On optimization of filter banks with denoising applications
The problem of optimization of subband coders for given input statistics has received considerable attention in recent literature. The goal in these works has been to maximize the...
Sony Akkarakaran, P. P. Vaidyanathan
GECCO
2010
Springer
141views Optimization» more  GECCO 2010»
14 years 1 months ago
Today/future importance analysis
SBSE techniques have been widely applied to requirements selection and prioritization problems in order to ascertain a suitable set of requirements for the next release of a syste...
Yuanyuan Zhang, Enrique Alba, Juan J. Durillo, Sig...