Sciweavers

555 search results - page 106 / 111
» Improved results for a memory allocation problem
Sort
View
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
ANCS
2008
ACM
14 years 11 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
TON
1998
103views more  TON 1998»
14 years 9 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
14 years 11 months ago
Searching for liveness property violations in concurrent systems with ACO
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
Enrique Alba, J. Francisco Chicano
BMCBI
2007
134views more  BMCBI 2007»
14 years 10 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...