Sciweavers

465 search results - page 91 / 93
» Dynamic Scheduling with Genetic Programming
Sort
View
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
SIGMETRICS
2003
ACM
129views Hardware» more  SIGMETRICS 2003»
14 years 19 days ago
Run-time modeling and estimation of operating system power consumption
The increasing constraints on power consumption in many computing systems point to the need for power modeling and estimation for all components of a system. The Operating System ...
Tao Li, Lizy Kurian John
ISSTA
2010
ACM
13 years 11 months ago
Analyzing concurrency bugs using dual slicing
Recently, there has been much interest in developing analyzes to detect concurrency bugs that arise because of data races, atomicity violations, execution omission, etc. However, ...
Dasarath Weeratunge, Xiangyu Zhang, William N. Sum...
CORR
2011
Springer
209views Education» more  CORR 2011»
13 years 2 months ago
Aneka Cloud Application Platform and Its Integration with Windows Azure
Aneka is an Application Platform-as-a-Service (Aneka PaaS) for Cloud Computing. It acts as a framework for building customized applications and deploying them on either public or ...
Yi Wei, Karthik Sukumar, Christian Vecchiola, Dile...
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
14 years 7 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua