Sciweavers

2766 search results - page 102 / 554
» Hybridizing a Logical Framework
Sort
View
JAPLL
2010
131views more  JAPLL 2010»
13 years 8 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
WWIC
2010
Springer
203views Communications» more  WWIC 2010»
14 years 3 months ago
Distributed Cooperation and Diversity for Hybrid Wireless Networks
In this paper, we propose a new Distributed Cooperation and Diversity Combining framework. Our focus is heterogeneous networks with devices equipped with two types of radio frequen...
Hooman Javaheri, Guevara Noubir, Y. Wang
IJON
2006
161views more  IJON 2006»
13 years 10 months ago
Evolving hybrid ensembles of learning machines for better generalisation
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
Arjun Chandra, Xin Yao
ICAIL
2009
ACM
14 years 4 months ago
Plausibility schemas: templates for legal factfinding
This paper describes a default-logic framework (plausibility schemas) and software tools (Decision ApprenticeTM and Legal ApprenticeTM ) for modeling, guiding and automating the r...
Vern R. Walker
ISBI
2009
IEEE
14 years 4 months ago
Probabilistic Branching Node Detection Using Hybrid Local Features
Probabilistic branching node inference is an important step for analyzing branching patterns involved in many anatomic structures. We propose combining machine learning techniques...
Haibin Ling, Michael Barnathan, Vasileios Megalooi...