Sciweavers

688 search results - page 118 / 138
» The Flow Set with Partial Order
Sort
View
CIKM
2007
Springer
14 years 2 months ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
PUK
2000
13 years 10 months ago
Scheduling in a Planning Environment
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
BMCBI
2005
128views more  BMCBI 2005»
13 years 8 months ago
Transformation and other factors of the peptide mass spectrometry pairwise peak-list comparison process
Background: Biological Mass Spectrometry is used to analyse peptides and proteins. A mass spectrum generates a list of measured mass to charge ratios and intensities of ionised pe...
Witold E. Wolski, Maciej Lalowski, Peter Martus, R...
JCT
1998
193views more  JCT 1998»
13 years 8 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
RSA
2010
107views more  RSA 2010»
13 years 7 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou