Sciweavers

2648 search results - page 492 / 530
» Challenges for Network Computer Games
Sort
View
BIOINFORMATICS
2006
124views more  BIOINFORMATICS 2006»
13 years 9 months ago
Probabilistic inference of transcription factor concentrations and gene-specific regulatory activities
Motivation Quantitative estimation of the regulatory relationship between transcription factors and genes is a fundamental stepping stone when trying to develop models of cellular...
Guido Sanguinetti, Neil D. Lawrence, Magnus Rattra...
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
14 years 3 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
WWW
2004
ACM
14 years 2 months ago
Flexible on-device service object replication with replets
An increasingly large amount of such applications employ service objects such as Servlets to generate dynamic and personalized content. Existing caching infrastructures are not we...
Dong Zhou, Nayeem Islam, Ali Ismael
ICNP
2002
IEEE
14 years 2 months ago
QoS Extension to BGP
To enable the end-to-end Quality of Service (QoS) guarantees in the Internet, based on the Border Gateway Protocol (BGP), inter-domain QoS advertising and routing are important. H...
Li Xiao, King-Shan Lui, Jun Wang, Klara Nahrstedt
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 1 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...