Sciweavers

336 search results - page 18 / 68
» Relevance heuristics for program analysis
Sort
View
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
13 years 11 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
HPCA
2007
IEEE
14 years 8 months ago
Exploiting Postdominance for Speculative Parallelization
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam...
CONSTRAINTS
2011
12 years 11 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
SCAM
2002
IEEE
14 years 16 days ago
Dynamic Slicing Object-Oriented Programs for Debugging
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
Baowen Xu, Zhenqiang Chen, Hongji Yang
ICSM
2005
IEEE
14 years 1 months ago
Dynamic Feature Traces: Finding Features in Unfamiliar Code
This paper introduces an automated technique for feature location: helping developers map features to relevant source code. Like several other automated feature location technique...
Andrew David Eisenberg, Kris De Volder