Sciweavers

3885 search results - page 763 / 777
» Clarifying Goal Models
Sort
View
BMCBI
2007
115views more  BMCBI 2007»
15 years 3 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
BMCBI
2007
128views more  BMCBI 2007»
15 years 3 months ago
Combining classifiers to predict gene function in Arabidopsis thaliana using large-scale gene expression measurements
Background: Arabidopsis thaliana is the model species of current plant genomic research with a genome size of 125 Mb and approximately 28,000 genes. The function of half of these ...
Hui Lan, Rachel Carson, Nicholas J. Provart, Antho...
COMCOM
2007
82views more  COMCOM 2007»
15 years 3 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
JAIR
2008
104views more  JAIR 2008»
15 years 3 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
JAL
2006
101views more  JAL 2006»
15 years 3 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...