5314 search results - page 764 / 1063 » Hybrid Dynamic Programming |
151
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
191
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asy...
299
click to vote
PADL
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
264
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
182
click to vote
RECOMB
2005
Springer
16 years 7 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...