Sciweavers

2413 search results - page 473 / 483
» Understanding the problem
Sort
View
84
Voted
BMCBI
2004
135views more  BMCBI 2004»
14 years 9 months ago
Information assessment on predicting protein-protein interactions
Background: Identifying protein-protein interactions is fundamental for understanding the molecular machinery of the cell. Proteome-wide studies of protein-protein interactions ar...
Nan Lin, Baolin Wu, Ronald Jansen, Mark Gerstein, ...
BMCBI
2004
150views more  BMCBI 2004»
14 years 9 months ago
Cross-species comparison significantly improves genome-wide prediction of cis-regulatory modules in Drosophila
Background: The discovery of cis-regulatory modules in metazoan genomes is crucial for understanding the connection between genes and organism diversity. It is important to quanti...
Saurabh Sinha, Mark D. Schroeder, Ulrich Unnerstal...
CN
2000
128views more  CN 2000»
14 years 9 months ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
J. Mark Pullen
120
Voted
CONCURRENCY
2000
133views more  CONCURRENCY 2000»
14 years 9 months ago
OpenMP versus threading in C/C++
When comparing OpenMP to other parallel programming models, it is easier to choose between OpenMP and MPI than between OpenMP and POSIX Threads (Pthreads). With languages like C a...
Bob Kuhn, Paul Petersen, Eamonn O'Toole
77
Voted
JAIR
2000
123views more  JAIR 2000»
14 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill