Sciweavers

181 search results - page 16 / 37
» New Inference Rules for Max-SAT
Sort
View
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 8 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
EUSFLAT
2007
161views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
On Additive and Multiplicative Fuzzy Models
Systems which use a fuzzy rule base and an inference mechanisms are quite frequently used in many applications. Fuzzy rules and inference mechanisms can be described by a system o...
Martin Stepnicka, Bernard De Baets, Lenka Noskov&a...
ICFP
1999
ACM
14 years 1 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
SAC
2009
ACM
14 years 3 months ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
CTRS
1990
14 years 1 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang