Sciweavers

598 search results - page 91 / 120
» Efficient and User-Friendly Verification
Sort
View
RTSS
1998
IEEE
15 years 1 months ago
Membership Questions for Timed and Hybrid Automata
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
76
Voted
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Node Mergers in the Presence of Don't Cares
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...
84
Voted
AIPS
2009
14 years 10 months ago
A Semantics for HTN Methods
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...
Robert P. Goldman
PODC
2011
ACM
14 years 15 days ago
Analyzing consistency properties for fun and profit
:  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...
Wojciech M. Golab, Xiaozhou Li, Mehul A. Shah
71
Voted
ICCV
2009
IEEE
16 years 2 months ago
Multi-Scale Object Detection by Clustering Lines
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 ...
Bjorn Ommer, Jitendra Malik