2254 search results - page 119 / 451 » Computing the minimal covering set |
95
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
Resource allocation is a fundamental but challenging problem due to the complexity of cluster computing systems. In enterprise service computing, resource allocation is often asso...
116
click to vote
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
Real-time monitoring is increasingly becoming important in various scenes of large scale, multi-site distributed/parallel computing, e.g, understanding behavior of systems, schedu...
95
Voted
IJAR
2006
15 years 23 days ago
2006
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
101
click to vote
TCBB
2008
15 years 21 days ago
2008
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
105
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...