Sciweavers

16 search results - page 3 / 4
» Use of MATLAB in teaching the fundamentals of random variabl...
Sort
View
CP
2007
Springer
13 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
AUSAI
2007
Springer
13 years 10 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
ICC
2009
IEEE
139views Communications» more  ICC 2009»
13 years 4 months ago
Impact of Topology and Shadowing on the Outage Probability of Cellular Networks
This paper proposes an analytical study of the shadowing impact on the outage probability in cellular radio networks. We establish that the downlink other-cell interference factor,...
Jean Marc Kelif, Marceau Coupechoux
AI
2008
Springer
13 years 6 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
AAAI
2011
12 years 6 months ago
Logistic Methods for Resource Selection Functions and Presence-Only Species Distribution Models
In order to better protect and conserve biodiversity, ecologists use machine learning and statistics to understand how species respond to their environment and to predict how they...
Steven Phillips, Jane Elith