Sciweavers

4181 search results - page 346 / 837
» Evaluating Usefulness for Dynamic Classification
Sort
View
SIGSOFT
2006
ACM
16 years 5 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
STACS
1999
Springer
15 years 9 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
CEC
2005
IEEE
15 years 10 months ago
Ecology-inspired evolutionary algorithm using feasibility-based grouping for constrained optimization
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...
Ming Yuchi, Jong-Hwan Kim
MSS
2005
IEEE
138views Hardware» more  MSS 2005»
15 years 10 months ago
Security vs Performance: Tradeoffs using a Trust Framework
We present an architecture of a trust framework that can be utilized to intelligently tradeoff between security and performance in a SAN file system. The primary idea is to diffe...
Aameek Singh, Sandeep Gopisetty, Linda Duyanovich,...
HPCA
2004
IEEE
16 years 5 months ago
Creating Converged Trace Schedules Using String Matching
This paper focuses on generating efficient software pipelined schedules for in-order machines, which we call Converged Trace Schedules. For a candidate loop, we form a string of t...
Satish Narayanasamy, Yuanfang Hu, Suleyman Sair, B...