1727 search results - page 206 / 346 » A Technique for Large Automated Mechanism Design Problems |
178
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
173
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
164
click to vote
CSEE
2003
Springer
15 years 11 months ago
2003
Springer
The typical software engineering course consists of lectures in which concepts and theories are conveyed, along with a small “toy” software engineering project which attempts ...
176
click to vote
FLAIRS
2006
15 years 7 months ago
2006
The huge volumes of unstructured texts available online drives the increasing need for automated techniques to analyze and extract knowledge from these repositories of information...
234
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...