Sciweavers

299 search results - page 41 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
STACS
2005
Springer
15 years 5 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
BMCBI
2006
158views more  BMCBI 2006»
14 years 11 months ago
Parallelization of multicategory support vector machines (PMC-SVM) for classifying microarray data
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
15 years 6 months ago
Explicit model predictive control for linear parameter-varying systems
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
Thomas Besselmann, Johan Löfberg, Manfred Mor...
BMEI
2008
IEEE
15 years 6 months ago
A New Approach for Tree Alignment Based on Local Re-Optimization
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
Feng Yue, Jijun Tang
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
15 years 4 months ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...