502 search results - page 64 / 101 » Verifying Balanced Trees |
93
Voted
ASIAN
2003
Springer
15 years 5 months ago
2003
Springer
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
102
Voted
DAC
1999
ACM
15 years 4 months ago
1999
ACM
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
95
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
113
click to vote
ATVA
2006
Springer
15 years 4 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
127
click to vote
AIPS
2006
15 years 1 months ago
2006
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...