Sciweavers

6251 search results - page 1031 / 1251
» Randomness, Computability, and Density
Sort
View
134
Voted
BMCBI
2010
154views more  BMCBI 2010»
15 years 4 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
EC
2006
163views ECommerce» more  EC 2006»
15 years 4 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
BMCBI
2007
141views more  BMCBI 2007»
15 years 4 months ago
Artificial neural network models for prediction of intestinal permeability of oligopeptides
Background: Oral delivery is a highly desirable property for candidate drugs under development. Computational modeling could provide a quick and inexpensive way to assess the inte...
Eunkyoung Jung, Junhyoung Kim, Minkyoung Kim, Dong...
MST
2002
128views more  MST 2002»
15 years 4 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
WINET
2002
163views more  WINET 2002»
15 years 4 months ago
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
Claudio Casetti, Mario Gerla, Saverio Mascolo, M. ...
« Prev « First page 1031 / 1251 Last » Next »