Sciweavers

12272 search results - page 42 / 2455
» Experimental program analysis
Sort
View
AAAI
2008
14 years 1 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
WICON
2008
14 years 12 days ago
Programming in mobile ad hoc networks
The possibility for spontaneous ad hoc networks between mobile devices has been increasing as small devices become more capable of hosting useful networked applications. These app...
Justin Collins, Rajive Bagrodia
PLDI
2003
ACM
14 years 4 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 5 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
14 years 2 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