172 search results - page 33 / 35 » Program generation for the all-pairs shortest path problem |
79
Voted
EUROMICRO
2007
IEEE
15 years 3 months ago
2007
IEEE
Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single compon...
87
Voted
RECOMB
2005
Springer
15 years 9 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...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we present an interactive offline tracking system for generic color objects. The system achieves 60100 fps on a 320 ? 240 video. The user can therefore easily refin...
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
CADE
2002
Springer
15 years 9 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...