2989 search results - page 221 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
116
Voted
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
124
Voted
APN
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
136
Voted
TLDI
2009
ACM
15 years 11 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
138
Voted
FM
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
111
Voted
TIT
1998
15 years 2 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...