Sciweavers

2976 search results - page 571 / 596
» On the bounded integer programming
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 2 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
OSDI
2002
ACM
16 years 2 months ago
Cooperative I/O: A Novel I/O Semantics for Energy-Aware Applications
In this paper we demonstrate the benefits of application involvement in operating system power management. We present Coop-I/O, an approach to reduce the power consumption of devi...
Andreas Weissel, Bjórn Beutel, Frank Bellos...
ICSE
2005
IEEE-ACM
16 years 2 months ago
Automatic discovery of API-level exploits
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...
Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Tho...
125
Voted
PPOPP
2010
ACM
15 years 11 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
EUROSYS
2008
ACM
15 years 11 months ago
Manageable fine-grained information flow
The continuing frequency and seriousness of security incidents underlines the importance of application security. Decentralized information flow control (DIFC), a promising tool ...
Petros Efstathopoulos, Eddie Kohler