Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...
: Analyzing Consistency Properties for Fun and Profit Wojciech Golab, Xiaozhou Li, Mehul A. Shah HP Laboratories HPL-2011-6 data consistency, algorightms, key-value stores Moti...
Object detection in cluttered, natural scenes has a high
complexity since many local observations compete for object
hypotheses. Voting methods provide an efficient solution
to ...