Sciweavers

294 search results - page 44 / 59
» diagrams 2006
Sort
View
JSAT
2006
126views more  JSAT 2006»
14 years 9 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
59
Voted
JSS
2006
62views more  JSS 2006»
14 years 9 months ago
A method for defining IEEE Std 1471 viewpoints
With the growing impact of information technology the proper understanding of IT-architecture designs is becoming ever more important. Much debate has been going on about how to d...
Henk Koning, Hans van Vliet
JSS
2006
88views more  JSS 2006»
14 years 9 months ago
A formal representation of functional size measurement methods
Estimating software size is a difficult task that requires a methodological approach. Many different methods that exist today use distinct abstractions to depict a software system...
Marjan Hericko, Ivan Rozman, Ales Zivkovic
JUCS
2006
107views more  JUCS 2006»
14 years 9 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
JAR
2000
97views more  JAR 2000»
14 years 9 months ago
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang