2244 search results - page 194 / 449 » A new heuristic approach for non-convex optimization problem... |
165
click to vote
ICALP
2005
Springer
16 years 22 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
198
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
We consider the problem of computing the root-mean-square (RMS) gain of switched linear systems. We develop a new approach which is based on an attempt to characterize the "w...
180
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
190
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when th...
215
click to vote
ASPDAC
2004
ACM
16 years 19 days ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...