Sciweavers

1972 search results - page 85 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
GECCO
2010
Springer
150views Optimization» more  GECCO 2010»
14 years 2 months ago
Object-level recombination of commodity applications
This paper presents ObjRecombGA, a genetic algorithm framework for recombining related programs at the object file level. A genetic algorithm guides the selection of object file...
Blair Foster, Anil Somayaji
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
14 years 4 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer
POPL
2005
ACM
14 years 9 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
WCFLP
2005
ACM
14 years 2 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
EGH
2005
Springer
14 years 2 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich