The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
This paper proposes an equation-based multi-scenario iterative robust optimization methodology for analog/mixed-signal circuits. We show that due to local circuit performance mono...
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...