217 search results - page 31 / 44 » An improved dynamic programming algorithm for coalition stru... |
ECOOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ISSTA
2012
ACM
11 years 10 months ago
2012
ACM
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
SPAA
2012
ACM
11 years 10 months ago
2012
ACM
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
SIGPLAN
2002
13 years 7 months ago
2002
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...