Sciweavers

666 search results - page 65 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
CP
2007
Springer
14 years 3 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
FSTTCS
2001
Springer
14 years 1 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
ICCBR
1997
Springer
14 years 1 months ago
From Troubleshooting to Process Design: Closing the Manufacturing Loop
This paper describes the dual use of a case base for diagnosis and for improving the design of a manufacturing process. In the short term, the case base is used to provide past ex...
Chris J. Price, Ian S. Pegler, M. B. Ratcliffe, A....
SOUPS
2005
ACM
14 years 2 months ago
Stopping spyware at the gate: a user study of privacy, notice and spyware
Spyware is a significant problem for most computer users. The term “spyware” loosely describes a new class of computer software. This type of software may track user activitie...
Nathaniel Good, Rachna Dhamija, Jens Grossklags, D...
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 3 months ago
Power Allocation in Multi-Carrier Networks with Unicast and Multicast Services
—Since the provision of both unicast and multicast services is expected for the next generation of multi-carrier wireless systems, the allocation of resources for this combinatio...
Yuri C. B. Silva, Anja Klein