Sciweavers

2316 search results - page 339 / 464
» The many forms of hypercomputation
Sort
View
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 11 months ago
Exploiting Cycle Structures in Max-SAT
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
Chu Min Li, Felip Manyà, Nouredine Ould Moh...
SIGMETRICS
2009
ACM
134views Hardware» more  SIGMETRICS 2009»
15 years 11 months ago
DRAM errors in the wild: a large-scale field study
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...
Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich ...
SUTC
2008
IEEE
15 years 11 months ago
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different typ...
Vasanth Iyer, Rammurthy Garimella, M. B. Srinivas
INFOCOM
2007
IEEE
15 years 11 months ago
The Cache Inference Problem and its Application to Content and Request Routing
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
Nikolaos Laoutaris, Georgios Zervas, Azer Bestavro...
CIE
2007
Springer
15 years 11 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer