13841 search results - page 2518 / 2769 » Algorithms and Constraint Programming |
156
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
132
click to vote
ASPLOS
1992
ACM
15 years 8 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
138
click to vote
ESWS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
131
Voted
DSN
2004
IEEE
15 years 7 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
131
click to vote
CF
2006
ACM
15 years 7 months ago
2006
ACM
The slowing pace of commodity microprocessor performance improvements combined with ever-increasing chip power demands has become of utmost concern to computational scientists. As...