4413 search results - page 131 / 883 » New Directions for CACM |
180
click to vote
ANCS
2010
ACM
15 years 3 months ago
2010
ACM
TCP/IP, the most commonly used network protocol, consumes a significant portion of time in Internet servers. While a wide spectrum of studies has been done to reduce its processin...
176
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
181
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
165
click to vote
ECCC
2008
15 years 6 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
156
click to vote
TASE
2008
IEEE
15 years 5 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...