Sciweavers

1760 search results - page 196 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
DAIS
2010
13 years 9 months ago
Distributed Fault Tolerant Controllers
Distributed applications are often built from sets of distributed components that must be co-ordinated in order to achieve some global behaviour. The common approach is to use a c...
Leonardo Mostarda, Rudi Ball, Naranker Dulay
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 4 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
13 years 12 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
ECCC
2007
122views more  ECCC 2007»
13 years 8 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
WWW
2006
ACM
14 years 8 months ago
WS-replication: a framework for highly available web services
Due to the rapid acceptance of web services and its fast spreading, a number of mission-critical systems will be deployed as web services in next years. The availability of those ...
Jorge Salas, Francisco Perez-Sorrosal, Marta Pati&...