10608 search results - page 335 / 2122 » Complexity of O'Hara's Algorithm |
83
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
114
Voted
CSB
2003
IEEE
15 years 6 months ago
2003
IEEE
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
103
Voted
ATVA
2006
Springer
15 years 4 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
76
Voted
ICASSP
2010
IEEE
15 years 28 days ago
2010
IEEE
In the last decade various time- and frequency-domain algorithms were derived to blindly identify acoustic systems. One of these algorithms is the multichannel Newton (MCN) algori...