Sciweavers

82 search results - page 13 / 17
» Selected Methods of Model Checking Using SAT and SMT-Solvers
Sort
View
ICCPOL
2009
Springer
14 years 8 months ago
A Simple and Efficient Model Pruning Method for Conditional Random Fields
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
Hai Zhao, Chunyu Kit
JUCS
2007
108views more  JUCS 2007»
14 years 10 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
COLING
2010
14 years 5 months ago
Learning Web Query Patterns for Imitating Wikipedia Articles
This paper presents a novel method for acquiring a set of query patterns to retrieve documents containing important information about an entity. Given an existing Wikipedia catego...
Shohei Tanaka, Naoaki Okazaki, Mitsuru Ishizuka
DAGSTUHL
2006
14 years 11 months ago
Model Development in the UML-based Specification Environment (USE)
Abstract. The tool USE (UML-based Specification Environment) supports analysts, designers, and developers in executing UML models and checking OCL constraints and thus enables them...
Martin Gogolla
81
Voted
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
15 years 5 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang