15033 search results - page 145 / 3007 » Complexity Theory and Algorithms |
133
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
149
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
154
click to vote
TSP
2010
14 years 10 months ago
2010
Abstract--We derive a class of algorithms for independent component analysis (ICA) based on maximum likelihood (ML) estimation and perform stability analysis of natural gradient ML...
141
click to vote
ICTAI
2003
IEEE
15 years 9 months ago
2003
IEEE
Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three drivin...
113
click to vote
ICCAD
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper addresses the issue of timing driven gate duplication for delay optimization. Gate duplication has been used extensively for cutset minimization but the usefulness in m...