Sciweavers

738 search results - page 60 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
CAV
2009
Springer
157views Hardware» more  CAV 2009»
15 years 10 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
WSC
2004
14 years 11 months ago
Steady-State Simulation Analysis Using Asap3
We discuss ASAP3, a refinement of the batch means algorithms ASAP and ASAP2. ASAP3 is a sequential procedure designed to produce a confidence-interval estimator for the expected r...
Natalie M. Steiger, Emily K. Lada, James R. Wilson...
ACMSE
2005
ACM
15 years 3 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha
JVCA
2008
112views more  JVCA 2008»
14 years 9 months ago
Constraint-based motion synthesis for deformable models
We present a fast goal-directed motion synthesis technique that integrates sample-based planning methods with constraint-based dynamics simulation using a finite element formulati...
William Moss, Ming C. Lin, Dinesh Manocha
AI
2010
Springer
14 years 10 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...