Sciweavers

900 search results - page 178 / 180
» Pure Type Systems Formalized
Sort
View
JMLR
2006
169views more  JMLR 2006»
13 years 7 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
ENTCS
2007
168views more  ENTCS 2007»
13 years 7 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
JKM
2007
161views more  JKM 2007»
13 years 7 months ago
A strategy-based ontology of knowledge management technologies
Purpose – The purpose of this paper is to distinguish and describe knowledge management (KM) technologies according to their support for strategy. Design/methodology/approach ...
Andre Saito, Katsuhiro Umemoto, Mitsuru Ikeda
EMSOFT
2010
Springer
13 years 5 months ago
From high-level component-based models to distributed implementations
Constructing correct distributed systems from their high-level models has always been a challenge and often subject to serious errors because of their non-deterministic and non-at...
Borzoo Bonakdarpour, Marius Bozga, Mohamad Jaber, ...
JLP
2010
96views more  JLP 2010»
13 years 2 months ago
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
Grigore Rosu, Traian-Florin Serbanuta