Sciweavers

3937 search results - page 570 / 788
» Questioning Ubiquitous Computing
Sort
View
BMCBI
2008
211views more  BMCBI 2008»
15 years 2 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
CN
2007
89views more  CN 2007»
15 years 2 months ago
Determining an appropriate sending rate over an underutilized network path
Determining an appropriate sending rate when beginning data transmission into a network with unknown characteristics is a fundamental issue in best-effort networks. Traditionally,...
Pasi Sarolahti, Mark Allman, Sally Floyd
135
Voted
AIM
2005
15 years 2 months ago
If Not Turing's Test, Then What?
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
Paul R. Cohen
109
Voted
BMCBI
2005
107views more  BMCBI 2005»
15 years 2 months ago
An edit script for taxonomic classifications
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
Roderic D. M. Page, Gabriel Valiente
JSYML
2007
100views more  JSYML 2007»
15 years 2 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore