— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
Sean Safarpour, Andreas G. Veneris, Rolf Drechsler
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Despite advances in situational method engineering, many software organizations continue to adopt an ad-hoc mix of method fragments from wellknown development methods such as Scrum...
Hesam Chiniforooshan Esfahani, Eric Yu, Jordi Cabo...
Modeling spatial context (e.g., autocorrelation) is a key challenge in classification problems that arise in geospatial domains. Markov random fields (MRF) is a popular model for i...
Shashi Shekhar, Paul R. Schrater, Ranga Raju Vatsa...
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...