Sciweavers

2434 search results - page 442 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
BMCBI
2007
141views more  BMCBI 2007»
15 years 2 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...
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 1 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
WINET
2002
163views more  WINET 2002»
15 years 1 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. ...
PPOPP
2012
ACM
13 years 9 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 7 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet