Sciweavers

2107 search results - page 156 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 3 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
146
Voted
ICAS
2009
IEEE
126views Robotics» more  ICAS 2009»
15 years 7 months ago
Heterogeneous QoS Resource Manager with Prediction
As long as computers continue to get more CPU processing power, data centers need to optimize their power usage. We can do this and maintain the same complexity level as before by...
Ramon Nou, Jordi Torres
HPCC
2007
Springer
15 years 9 months ago
Optimizing Performance of Automatic Training Phase for Application Performance Prediction in the Grid
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
Farrukh Nadeem, Radu Prodan, Thomas Fahringer
123
Voted
ICCAD
1997
IEEE
131views Hardware» more  ICCAD 1997»
15 years 7 months ago
COSMOS: a continuous optimization approach for maximum power estimation of CMOS circuits
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...
Chuan-Yu Wang, Kaushik Roy
AINA
2008
IEEE
15 years 3 months ago
Communication Protocols and Message Formats for BLAST Parallelization on Cluster Systems
With the widespread use of BLAST, many parallel versions of BLAST on cluster systems are announced, but little work has been done for the parallel execution in the search for indi...
Hong-Soog Kim, Woo-Hyuk Jang, Dong-Soo Han