Sciweavers

409 search results - page 50 / 82
» Polynomial Time Approximation Schemes and Parameterized Comp...
Sort
View
DLT
2003
14 years 11 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
CEC
2007
IEEE
15 years 4 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 3 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
ICCS
2007
Springer
15 years 3 months ago
Hierarchical-Matrix Preconditioners for Parabolic Optimal Control Problems
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
Suely Oliveira, Fang Yang
WABI
2005
Springer
15 years 3 months ago
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. C...