1114 search results - page 61 / 223 » Validating optimizations of concurrent C C programs |
BMCBI
2005
13 years 8 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
SIAMJO
2002
13 years 8 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
IJCNN
2008
IEEE
14 years 3 months ago
2008
IEEE
— Much recent research activity has focused on the theory and application of quantum calculus. This branch of mathematics continues to find new and useful applications and there ...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
PLDI
1999
ACM
14 years 1 months ago
1999
ACM
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...