8232 search results - page 1314 / 1647 » Dynamic Logic Programming |
200
click to vote
CLOUDCOM
2010
Springer
15 years 4 months ago
2010
Springer
Cloud computing has become one of the key considerations both in academia and industry. Cheap, seemingly unlimited computing resources that can be allocated almost instantaneously...
163
click to vote
ECCV
1998
Springer
16 years 8 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
150
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...
190
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...
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...