Limiting behaviour of random spatial graphs and asymptotically homogeneous RWRE [PDF]
, 2005 We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest neighbours graph, the on-line nearest-neighbour graph, and the minimal directed spanning tree.
Wade, Andrew R +2 more
core
Extended RDF: Computability and Complexity Issues [PDF]
, 2015 ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. Based
Analyti, Anastasia +3 more
core +1 more source
On dots in boxes, or Permutation pattern classes and regular languages [PDF]
, 2015 This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We found that the subsets of plus- and minus-(in)decomposable permutations of
Hoffmann, Ruth
core +2 more sources
Improvements in the reconstruction of time-varying gene regulatory networks: dynamic programming and regularization by information sharing among genes [PDF]
, 2010 <b>Method:</b> Dynamic Bayesian networks (DBNs) have been applied widely to reconstruct the structure of regulatory processes from time series data, and they have established themselves as a standard modelling tool in computational systems ...
Husmeier, D. +5 more
core +1 more source
An Accept-and-Reject Algorithm to Sample from a Set of Permutations Restricted by a Time Constraint [PDF]
A modification of an accept-and-reject algorithm to sample from a set of restricted permutations is proposed. By concentrating on a special class of matrices obtained by restriction of the permutation in time, assuming the objects to be permuted to be ...
Johannes Hüsing
core
A result on Hamiltonian line graphs involving restrictions on induced subgraphs [PDF]
, 1988 It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G.
Veldman, H.J., H. J. Veldman
core +2 more sources
CHANCE CONSTRAINED PROGRAMMING MODELS FOR RISK-BASED ECONOMIC AND POLICY ANALYSIS OF SOIL CONSERVATION [PDF]
The random nature of soil loss under alternative land-use practices should be an important consideration of soil conservation planning and analysis under risk.
Zhu, Minkang +3 more
core
A Logic Programming approach for Access Control over RDF
, 2014 The Resource Description Framework (RDF) is an interoperable data representation format suitable for interchange and integration of data, especially in Open Data contexts.
Axel Polleres +9 more
core +1 more source
Particle swarm for attribute selection in Bayesian classification: an application to protein function prediction [PDF]
, 2008 The discrete particle swarm optimization (DPSO) algorithm is an optimization technique which belongs to the fertile paradigm of Swarm Intelligence. Designed for the task of attribute selection, the DPSO deals with discrete variables in a straightforward ...
Freitas, AA +5 more
core +1 more source
Fuzzy solution of the linear programming problem with interval coefficients in the constraints [PDF]
A fuzzy concept of solving the linear programming problem with interval coefficients is proposed. For each optimism level of the decision maker (where the optimism concerns the certainty that no errors have been committed in the estimation of the ...
Dorota Kuchta
core