2027 search results - page 187 / 406 » When is it best to best-respond |
112
click to vote
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
113
click to vote
STOC
2001
ACM
16 years 1 months ago
2001
ACM
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
OSDI
2008
ACM
16 years 1 months ago
2008
ACM
An error that occurs in a microkernel operating system service can potentially result in state corruption and service failure. A simple restart of the failed service is not always...
109
click to vote
OSDI
2002
ACM
16 years 1 months ago
2002
ACM
It is becoming increasingly common to construct network services using redundant resources geographically distributed across the Internet. Content Distribution Networks are a prim...