Sciweavers

1204 search results - page 127 / 241
» Hybrid Probabilistic Programs
Sort
View
JSS
2010
107views more  JSS 2010»
14 years 11 months ago
An empirical investigation into branch coverage for C programs using CUTE and AUSTIN
Automated test data generation has remained a topic of considerable interest for several decades because it lies at the heart of attempts to automate the process of Software Testi...
Kiran Lakhotia, Phil McMinn, Mark Harman
110
Voted
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
15 years 6 months ago
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
Cassio Polpo de Campos, Fabio Gagliardi Cozman
96
Voted
JILP
2000
103views more  JILP 2000»
15 years 17 days ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
215
Voted
AI
2011
Springer
14 years 7 months ago
Local closed world reasoning with description logics under the well-founded semantics
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
Matthias Knorr, José Júlio Alferes, ...
HPCA
2002
IEEE
16 years 1 months ago
Bandwidth Adaptive Snooping
This paper advocates that cache coherence protocols use a bandwidth adaptive approach to adjust to varied system configurations (e.g., number of processors) and workload behaviors...
Milo M. K. Martin, Daniel J. Sorin, Mark D. Hill, ...