4679 search results - page 740 / 936 » Modeling When Connections Are the Problem |
159
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
178
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
155
click to vote
ISCAPDCS
2004
15 years 7 months ago
2004
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
180
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
202
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...